%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC211-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:43:29 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 59 ( 27 unt; 11 nHn; 55 RR)
% Number of literals : 131 ( 55 equ; 66 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 : 51 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_8,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_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(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(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
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(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/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,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
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,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
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(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
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,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk4
| app(X1,cons(X2,nil)) = nil ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_29 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_34,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != sk4
| app(X1,cons(X2,nil)) = nil ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_32 ).
cnf(c_0_38,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_39,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_40,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_35 ).
cnf(c_0_42,negated_conjecture,
( sk4 = nil
| app(skaf82(sk4),cons(skaf83(sk4),nil)) = nil ),
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_36,c_0_37]),c_0_38]),c_0_39])])]),c_0_40])]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(cons(skaf83(sk4),nil))
| sk4 = nil
| skaf82(sk4) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_39])]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_43 ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
( sk4 = nil
| skaf82(sk4) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38]),c_0_26])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,nil) != sk4
| app(nil,cons(X1,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_47]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
( sk4 = nil
| cons(skaf83(sk4),nil) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_48]),c_0_40])]) ).
cnf(c_0_52,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_49 ).
cnf(c_0_54,negated_conjecture,
( sk4 = nil
| app(nil,sk4) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_38]),c_0_40])]) ).
cnf(c_0_55,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_56,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_40]),c_0_26])]) ).
cnf(c_0_57,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC211-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.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:05:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.47 % Version: 3.5.1
% 0.10/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2974709 completed with status 0
% 0.10/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.47 % No SInE strategy applied
% 0.10/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.10/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.10/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.10/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2974716 completed with status 0
% 0.10/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.47 % No SInE strategy applied
% 0.10/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.10/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.47 % Preprocessing time : 0.002 s
% 0.10/0.47 % Presaturation interreduction done
% 0.10/0.47
% 0.10/0.47 % Proof found!
% 0.10/0.47 % SZS status Unsatisfiable
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47 % Parsed axioms : 195
% 0.10/0.47 % Removed by relevancy pruning/SinE : 0
% 0.10/0.47 % Initial clauses : 195
% 0.10/0.47 % Removed in clause preprocessing : 0
% 0.10/0.47 % Initial clauses in saturation : 195
% 0.10/0.47 % Processed clauses : 447
% 0.10/0.47 % ...of these trivial : 2
% 0.10/0.47 % ...subsumed : 18
% 0.10/0.47 % ...remaining for further processing : 427
% 0.10/0.47 % Other redundant clauses eliminated : 71
% 0.10/0.47 % Clauses deleted for lack of memory : 0
% 0.10/0.47 % Backward-subsumed : 3
% 0.10/0.47 % Backward-rewritten : 20
% 0.10/0.47 % Generated clauses : 728
% 0.10/0.47 % ...of the previous two non-redundant : 605
% 0.10/0.47 % ...aggressively subsumed : 0
% 0.10/0.47 % Contextual simplify-reflections : 4
% 0.10/0.47 % Paramodulations : 653
% 0.10/0.47 % Factorizations : 0
% 0.10/0.47 % NegExts : 0
% 0.10/0.47 % Equation resolutions : 76
% 0.10/0.47 % Disequality decompositions : 0
% 0.10/0.47 % Total rewrite steps : 816
% 0.10/0.47 % ...of those cached : 738
% 0.10/0.47 % Propositional unsat checks : 0
% 0.10/0.47 % Propositional check models : 0
% 0.10/0.47 % Propositional check unsatisfiable : 0
% 0.10/0.47 % Propositional clauses : 0
% 0.10/0.47 % Propositional clauses after purity: 0
% 0.10/0.47 % Propositional unsat core size : 0
% 0.10/0.47 % Propositional preprocessing time : 0.000
% 0.10/0.47 % Propositional encoding time : 0.000
% 0.10/0.47 % Propositional solver time : 0.000
% 0.10/0.47 % Success case prop preproc time : 0.000
% 0.10/0.47 % Success case prop encoding time : 0.000
% 0.10/0.47 % Success case prop solver time : 0.000
% 0.10/0.47 % Current number of processed clauses : 194
% 0.10/0.47 % Positive orientable unit clauses : 61
% 0.10/0.47 % Positive unorientable unit clauses: 0
% 0.10/0.47 % Negative unit clauses : 3
% 0.10/0.47 % Non-unit-clauses : 130
% 0.10/0.47 % Current number of unprocessed clauses: 530
% 0.10/0.47 % ...number of literals in the above : 3123
% 0.10/0.47 % Current number of archived formulas : 0
% 0.10/0.47 % Current number of archived clauses : 210
% 0.10/0.47 % Clause-clause subsumption calls (NU) : 12184
% 0.10/0.47 % Rec. Clause-clause subsumption calls : 1565
% 0.10/0.47 % Non-unit clause-clause subsumptions : 22
% 0.10/0.47 % Unit Clause-clause subsumption calls : 48
% 0.10/0.47 % Rewrite failures with RHS unbound : 0
% 0.10/0.47 % BW rewrite match attempts : 4
% 0.10/0.47 % BW rewrite match successes : 4
% 0.10/0.47 % Condensation attempts : 0
% 0.10/0.47 % Condensation successes : 0
% 0.10/0.47 % Termbank termtop insertions : 24972
% 0.10/0.47 % Search garbage collected termcells : 537
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.031 s
% 0.10/0.47 % System time : 0.007 s
% 0.10/0.47 % Total time : 0.038 s
% 0.10/0.47 % Maximum resident set size: 4064 pages
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.122 s
% 0.10/0.47 % System time : 0.026 s
% 0.10/0.47 % Total time : 0.149 s
% 0.10/0.47 % Maximum resident set size: 5120 pages
% 0.10/0.47 % E exiting
%------------------------------------------------------------------------------