TSTP Solution File: SWC211-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC211-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:24:26 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of clauses : 66 ( 23 unt; 22 nHn; 66 RR)
% Number of literals : 162 ( 71 equ; 79 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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_8,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
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(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_17,negated_conjecture,
~ neq(sk1,nil),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_18,negated_conjecture,
~ neq(sk1,nil),
c_0_17 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_23,negated_conjecture,
~ neq(sk3,nil),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,axiom,
ssList(nil),
clause8 ).
cnf(c_0_27,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_30,negated_conjecture,
( app(X1,cons(X2,nil)) = nil
| app(cons(X2,nil),X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_29 ).
cnf(c_0_32,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_34,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_35,negated_conjecture,
( app(X1,cons(X2,nil)) = nil
| cons(X2,X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_39,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = nil
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36])]),c_0_37])]) ).
cnf(c_0_40,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_38 ).
cnf(c_0_41,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_42,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_43,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = nil
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37])]) ).
cnf(c_0_44,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_41 ).
cnf(c_0_45,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_37])]) ).
cnf(c_0_47,negated_conjecture,
( tl(sk4) = nil
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_49,negated_conjecture,
( tl(sk4) = nil
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_37])]) ).
cnf(c_0_50,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_48 ).
cnf(c_0_51,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_52,negated_conjecture,
( tl(sk4) = nil
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_26])]) ).
cnf(c_0_53,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_51 ).
cnf(c_0_54,negated_conjecture,
( tl(sk4) = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_40]),c_0_37])]) ).
cnf(c_0_55,negated_conjecture,
( app(nil,cons(X1,nil)) = nil
| cons(X1,nil) != sk4
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_53]),c_0_26])]) ).
cnf(c_0_56,negated_conjecture,
( cons(hd(sk4),nil) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_54]),c_0_37])]) ).
cnf(c_0_57,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_58,negated_conjecture,
( app(nil,sk4) = nil
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_37])]) ).
cnf(c_0_59,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_60,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_57 ).
cnf(c_0_61,negated_conjecture,
( app(nil,sk4) = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_40]),c_0_37])]) ).
cnf(c_0_62,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_59,c_0_34]) ).
cnf(c_0_63,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_37]),c_0_26])]) ).
cnf(c_0_64,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC211-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:10:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # sh5l with pid 3909 completed with status 0
% 0.19/0.51 # Result found by sh5l
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.51 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 3914 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.51 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 195
% 0.19/0.51 # Removed by relevancy pruning/SinE : 30
% 0.19/0.51 # Initial clauses : 165
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 165
% 0.19/0.51 # Processed clauses : 323
% 0.19/0.51 # ...of these trivial : 2
% 0.19/0.51 # ...subsumed : 16
% 0.19/0.51 # ...remaining for further processing : 305
% 0.19/0.51 # Other redundant clauses eliminated : 26
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 6
% 0.19/0.51 # Backward-rewritten : 14
% 0.19/0.51 # Generated clauses : 123
% 0.19/0.51 # ...of the previous two non-redundant : 104
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 4
% 0.19/0.51 # Paramodulations : 96
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 28
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 109
% 0.19/0.51 # ...of those cached : 98
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 108
% 0.19/0.51 # Positive orientable unit clauses : 43
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 64
% 0.19/0.51 # Current number of unprocessed clauses: 100
% 0.19/0.51 # ...number of literals in the above : 465
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 177
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 6932
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 1236
% 0.19/0.51 # Non-unit clause-clause subsumptions : 26
% 0.19/0.51 # Unit Clause-clause subsumption calls : 44
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 2
% 0.19/0.51 # BW rewrite match successes : 2
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 9611
% 0.19/0.51 # Search garbage collected termcells : 612
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.022 s
% 0.19/0.51 # System time : 0.004 s
% 0.19/0.51 # Total time : 0.026 s
% 0.19/0.51 # Maximum resident set size: 2208 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.025 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.032 s
% 0.19/0.51 # Maximum resident set size: 1896 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------