TSTP Solution File: SWC092-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC092-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:23:14 EDT 2024
% Result : Unsatisfiable 0.86s 0.56s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 48 ( 20 unt; 4 nHn; 48 RR)
% Number of literals : 113 ( 24 equ; 72 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_13,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_10,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_14,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( nil = sk4
| nil != sk3 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_18,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_19,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( nil = sk4
| nil != sk3 ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_25,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( neq(nil,nil)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
ssList(nil),
clause8 ).
cnf(c_0_30,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_31,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_24 ).
cnf(c_0_33,negated_conjecture,
( X1 = sk3
| neq(sk3,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_30 ).
cnf(c_0_36,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_20]),c_0_16]) ).
cnf(c_0_38,negated_conjecture,
neq(sk3,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_34]) ).
cnf(c_0_39,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
app(sk3,sk5) = sk4,
co1_10 ).
cnf(c_0_41,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_42,negated_conjecture,
( ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26])]) ).
cnf(c_0_43,negated_conjecture,
( segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_26])]) ).
cnf(c_0_44,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_45,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_26])]) ).
cnf(c_0_46,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC092-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 02:37:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.86/0.56 # Version: 3.1.0
% 0.86/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.86/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.86/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.56 # Starting sh5l with 300s (1) cores
% 0.86/0.56 # new_bool_1 with pid 8063 completed with status 0
% 0.86/0.56 # Result found by new_bool_1
% 0.86/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.86/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.86/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.86/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.86/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.86/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8066 completed with status 0
% 0.86/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.86/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.86/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.86/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.86/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.86/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.86/0.56 # Preprocessing time : 0.002 s
% 0.86/0.56 # Presaturation interreduction done
% 0.86/0.56
% 0.86/0.56 # Proof found!
% 0.86/0.56 # SZS status Unsatisfiable
% 0.86/0.56 # SZS output start CNFRefutation
% See solution above
% 0.86/0.56 # Parsed axioms : 198
% 0.86/0.56 # Removed by relevancy pruning/SinE : 127
% 0.86/0.56 # Initial clauses : 71
% 0.86/0.56 # Removed in clause preprocessing : 0
% 0.86/0.56 # Initial clauses in saturation : 71
% 0.86/0.56 # Processed clauses : 880
% 0.86/0.56 # ...of these trivial : 14
% 0.86/0.56 # ...subsumed : 385
% 0.86/0.56 # ...remaining for further processing : 481
% 0.86/0.56 # Other redundant clauses eliminated : 20
% 0.86/0.56 # Clauses deleted for lack of memory : 0
% 0.86/0.56 # Backward-subsumed : 30
% 0.86/0.56 # Backward-rewritten : 8
% 0.86/0.56 # Generated clauses : 3051
% 0.86/0.56 # ...of the previous two non-redundant : 2718
% 0.86/0.56 # ...aggressively subsumed : 0
% 0.86/0.56 # Contextual simplify-reflections : 40
% 0.86/0.56 # Paramodulations : 3018
% 0.86/0.56 # Factorizations : 0
% 0.86/0.56 # NegExts : 0
% 0.86/0.56 # Equation resolutions : 28
% 0.86/0.56 # Disequality decompositions : 0
% 0.86/0.56 # Total rewrite steps : 2564
% 0.86/0.56 # ...of those cached : 2540
% 0.86/0.56 # Propositional unsat checks : 0
% 0.86/0.56 # Propositional check models : 0
% 0.86/0.56 # Propositional check unsatisfiable : 0
% 0.86/0.56 # Propositional clauses : 0
% 0.86/0.56 # Propositional clauses after purity: 0
% 0.86/0.56 # Propositional unsat core size : 0
% 0.86/0.56 # Propositional preprocessing time : 0.000
% 0.86/0.56 # Propositional encoding time : 0.000
% 0.86/0.56 # Propositional solver time : 0.000
% 0.86/0.56 # Success case prop preproc time : 0.000
% 0.86/0.56 # Success case prop encoding time : 0.000
% 0.86/0.56 # Success case prop solver time : 0.000
% 0.86/0.56 # Current number of processed clauses : 363
% 0.86/0.56 # Positive orientable unit clauses : 27
% 0.86/0.56 # Positive unorientable unit clauses: 0
% 0.86/0.56 # Negative unit clauses : 12
% 0.86/0.56 # Non-unit-clauses : 324
% 0.86/0.56 # Current number of unprocessed clauses: 1965
% 0.86/0.56 # ...number of literals in the above : 10617
% 0.86/0.56 # Current number of archived formulas : 0
% 0.86/0.56 # Current number of archived clauses : 108
% 0.86/0.56 # Clause-clause subsumption calls (NU) : 12059
% 0.86/0.56 # Rec. Clause-clause subsumption calls : 3913
% 0.86/0.56 # Non-unit clause-clause subsumptions : 353
% 0.86/0.56 # Unit Clause-clause subsumption calls : 541
% 0.86/0.56 # Rewrite failures with RHS unbound : 0
% 0.86/0.56 # BW rewrite match attempts : 7
% 0.86/0.56 # BW rewrite match successes : 7
% 0.86/0.56 # Condensation attempts : 0
% 0.86/0.56 # Condensation successes : 0
% 0.86/0.56 # Termbank termtop insertions : 55268
% 0.86/0.56 # Search garbage collected termcells : 864
% 0.86/0.56
% 0.86/0.56 # -------------------------------------------------
% 0.86/0.56 # User time : 0.081 s
% 0.86/0.56 # System time : 0.004 s
% 0.86/0.56 # Total time : 0.086 s
% 0.86/0.56 # Maximum resident set size: 2084 pages
% 0.86/0.56
% 0.86/0.56 # -------------------------------------------------
% 0.86/0.56 # User time : 0.083 s
% 0.86/0.56 # System time : 0.008 s
% 0.86/0.56 # Total time : 0.091 s
% 0.86/0.56 # Maximum resident set size: 1876 pages
% 0.86/0.56 % E---3.1 exiting
% 0.86/0.56 % E exiting
%------------------------------------------------------------------------------