TSTP Solution File: SWC109-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC109-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:27 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of clauses : 65 ( 17 unt; 13 nHn; 65 RR)
% Number of literals : 161 ( 57 equ; 94 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_23,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_23) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_18,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_16,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_22,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_19,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_23]) ).
cnf(c_0_20,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_21,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_22,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_29,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_21 ).
cnf(c_0_30,negated_conjecture,
( neq(sk4,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( sk4 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_32,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( neq(nil,nil)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_35,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
co1_18 ).
cnf(c_0_36,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_16 ).
cnf(c_0_38,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(sr,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_41,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_42,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
co1_15 ).
cnf(c_0_43,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_44,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_22]) ).
cnf(c_0_45,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_46,negated_conjecture,
( app(sk6,sk3) = nil
| sk4 != nil
| ~ ssList(app(sk6,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_47,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_41 ).
cnf(c_0_48,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_50,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
c_0_44 ).
cnf(c_0_51,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_52,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_45 ).
cnf(c_0_53,negated_conjecture,
( app(sk6,sk3) = nil
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_54,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_55,negated_conjecture,
( sk4 = nil
| ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_23]),c_0_23]),c_0_24]),c_0_24]) ).
cnf(c_0_56,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_51 ).
cnf(c_0_57,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_49]),c_0_48])]),c_0_36]) ).
cnf(c_0_58,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_59,negated_conjecture,
~ segmentP(sk4,sk3),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_49]),c_0_27])]),c_0_36]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_39]),c_0_48]),c_0_40]),c_0_49])]) ).
cnf(c_0_61,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_62,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_49])]) ).
cnf(c_0_63,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC109-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:08:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_3 with pid 17586 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 17590 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 209
% 0.21/0.53 # Removed by relevancy pruning/SinE : 137
% 0.21/0.53 # Initial clauses : 72
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 72
% 0.21/0.53 # Processed clauses : 276
% 0.21/0.53 # ...of these trivial : 2
% 0.21/0.53 # ...subsumed : 66
% 0.21/0.53 # ...remaining for further processing : 208
% 0.21/0.53 # Other redundant clauses eliminated : 13
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 19
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 320
% 0.21/0.53 # ...of the previous two non-redundant : 245
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 3
% 0.21/0.53 # Paramodulations : 297
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 18
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 339
% 0.21/0.53 # ...of those cached : 327
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 107
% 0.21/0.53 # Positive orientable unit clauses : 16
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 7
% 0.21/0.53 # Non-unit-clauses : 84
% 0.21/0.53 # Current number of unprocessed clauses: 95
% 0.21/0.53 # ...number of literals in the above : 493
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 93
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 2614
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 667
% 0.21/0.53 # Non-unit clause-clause subsumptions : 61
% 0.21/0.53 # Unit Clause-clause subsumption calls : 118
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 4
% 0.21/0.53 # BW rewrite match successes : 4
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 9288
% 0.21/0.53 # Search garbage collected termcells : 897
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.021 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.023 s
% 0.21/0.53 # Maximum resident set size: 2084 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.024 s
% 0.21/0.53 # System time : 0.006 s
% 0.21/0.53 # Total time : 0.030 s
% 0.21/0.53 # Maximum resident set size: 1876 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------