%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC420-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:44:21 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 55 ( 22 unt; 4 nHn; 51 RR)
% Number of literals : 127 ( 51 equ; 77 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 54 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_16,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_17,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_18,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_19,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_23,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_17 ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_18 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(app(X3,cons(X2,nil)),X1) != sk4
| app(app(X1,cons(X2,nil)),X3) != sk3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_22 ).
cnf(c_0_29,axiom,
ssList(nil),
clause8 ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != sk4
| app(X1,cons(X2,nil)) = sk3 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_25 ).
cnf(c_0_32,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_33,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_34,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(app(X2,cons(X1,nil)))
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) != sk3
| app(app(nil,cons(X1,nil)),X2) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_37,negated_conjecture,
( sk4 = nil
| app(skaf82(sk4),cons(skaf83(sk4),nil)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])])]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_40,negated_conjecture,
( app(app(nil,cons(skaf83(sk4),nil)),skaf82(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_38]),c_0_33])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_39 ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(skaf83(sk4),nil))
| app(cons(skaf83(sk4),nil),skaf82(sk4)) != sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_42 ).
cnf(c_0_45,negated_conjecture,
( app(cons(skaf83(sk4),nil),skaf82(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_32]),c_0_29])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_47,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_48,negated_conjecture,
( cons(skaf83(sk4),skaf82(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_24]),c_0_32]),c_0_33])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_46 ).
cnf(c_0_50,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_47,c_0_21]) ).
cnf(c_0_51,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_31]),c_0_34])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC420-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:23:02 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.42 Running first-order theorem proving
% 0.03/0.42 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.19/0.54 % Version: 3.5.1
% 0.19/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 % Starting sh5l with 300s (1) cores
% 0.19/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3009609 completed with status 0
% 0.19/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.54 % No SInE strategy applied
% 0.19/0.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.54 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.19/0.54 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.19/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3009616 completed with status 0
% 0.19/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.54 % No SInE strategy applied
% 0.19/0.54 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 % Preprocessing time : 0.004 s
% 0.19/0.54 % Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 % Proof found!
% 0.19/0.54 % SZS status Unsatisfiable
% 0.19/0.54 % SZS output start CNFRefutation
% See solution above
% 0.19/0.54 % Parsed axioms : 195
% 0.19/0.54 % Removed by relevancy pruning/SinE : 0
% 0.19/0.54 % Initial clauses : 195
% 0.19/0.54 % Removed in clause preprocessing : 0
% 0.19/0.54 % Initial clauses in saturation : 195
% 0.19/0.54 % Processed clauses : 950
% 0.19/0.54 % ...of these trivial : 3
% 0.19/0.54 % ...subsumed : 309
% 0.19/0.54 % ...remaining for further processing : 638
% 0.19/0.54 % Other redundant clauses eliminated : 183
% 0.19/0.54 % Clauses deleted for lack of memory : 0
% 0.19/0.54 % Backward-subsumed : 56
% 0.19/0.54 % Backward-rewritten : 113
% 0.19/0.54 % Generated clauses : 2155
% 0.19/0.54 % ...of the previous two non-redundant : 1917
% 0.19/0.54 % ...aggressively subsumed : 0
% 0.19/0.54 % Contextual simplify-reflections : 23
% 0.19/0.54 % Paramodulations : 1968
% 0.19/0.54 % Factorizations : 0
% 0.19/0.54 % NegExts : 0
% 0.19/0.54 % Equation resolutions : 188
% 0.19/0.54 % Disequality decompositions : 0
% 0.19/0.54 % Total rewrite steps : 2264
% 0.19/0.54 % ...of those cached : 2163
% 0.19/0.54 % Propositional unsat checks : 0
% 0.19/0.54 % Propositional check models : 0
% 0.19/0.54 % Propositional check unsatisfiable : 0
% 0.19/0.54 % Propositional clauses : 0
% 0.19/0.54 % Propositional clauses after purity: 0
% 0.19/0.54 % Propositional unsat core size : 0
% 0.19/0.54 % Propositional preprocessing time : 0.000
% 0.19/0.54 % Propositional encoding time : 0.000
% 0.19/0.54 % Propositional solver time : 0.000
% 0.19/0.54 % Success case prop preproc time : 0.000
% 0.19/0.54 % Success case prop encoding time : 0.000
% 0.19/0.54 % Success case prop solver time : 0.000
% 0.19/0.54 % Current number of processed clauses : 259
% 0.19/0.54 % Positive orientable unit clauses : 65
% 0.19/0.54 % Positive unorientable unit clauses: 0
% 0.19/0.54 % Negative unit clauses : 2
% 0.19/0.54 % Non-unit-clauses : 192
% 0.19/0.54 % Current number of unprocessed clauses: 1310
% 0.19/0.54 % ...number of literals in the above : 7487
% 0.19/0.54 % Current number of archived formulas : 0
% 0.19/0.54 % Current number of archived clauses : 356
% 0.19/0.54 % Clause-clause subsumption calls (NU) : 23591
% 0.19/0.54 % Rec. Clause-clause subsumption calls : 5201
% 0.19/0.54 % Non-unit clause-clause subsumptions : 297
% 0.19/0.54 % Unit Clause-clause subsumption calls : 158
% 0.19/0.54 % Rewrite failures with RHS unbound : 0
% 0.19/0.54 % BW rewrite match attempts : 7
% 0.19/0.54 % BW rewrite match successes : 7
% 0.19/0.54 % Condensation attempts : 0
% 0.19/0.54 % Condensation successes : 0
% 0.19/0.54 % Termbank termtop insertions : 51504
% 0.19/0.54 % Search garbage collected termcells : 543
% 0.19/0.54
% 0.19/0.54 % -------------------------------------------------
% 0.19/0.54 % User time : 0.087 s
% 0.19/0.54 % System time : 0.010 s
% 0.19/0.54 % Total time : 0.097 s
% 0.19/0.54 % Maximum resident set size: 4064 pages
% 0.19/0.54
% 0.19/0.54 % -------------------------------------------------
% 0.19/0.54 % User time : 0.385 s
% 0.19/0.54 % System time : 0.037 s
% 0.19/0.54 % Total time : 0.422 s
% 0.19/0.54 % Maximum resident set size: 5120 pages
% 0.19/0.54 % E exiting
%------------------------------------------------------------------------------