%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC313-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 : n017.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:54 PM UTC 2026
% Result : Unsatisfiable 0.22s 5.61s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 16 unt; 4 nHn; 39 RR)
% Number of literals : 105 ( 53 equ; 62 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 39 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,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_7) ).
cnf(co1_10,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
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(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_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_11,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
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(c_0_13,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_14,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_15,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,negated_conjecture,
( app(X2,cons(X1,nil)) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ ssList(X2)
| ~ ssItem(X1)
| nil = sk2 ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk2
| app(X1,cons(X2,nil)) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) != sk2
| sk2 = nil ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_20 ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_24,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != sk2
| sk2 = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_23 ).
cnf(c_0_27,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_28,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_29,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X1)
| X1 != sk2
| nil = X1
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[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_31,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_33,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_34,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_16]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
sk2 = nil,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_33 ).
cnf(c_0_38,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_35]),c_0_38])]) ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC313-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.46 % Computer : n017.cluster.edu
% 0.18/5.46 % Model : x86_64 x86_64
% 0.18/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46 % Memory : 8046.5625MB
% 0.18/5.46 % OS : Linux 6.8.0-71-generic
% 0.18/5.46 % CPULimit : 300
% 0.18/5.46 % WCLimit : 300
% 0.18/5.46 % DateTime : Mon Sep 21 08:09:47 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.52 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.22/5.61 % Version: 3.5.1
% 0.22/5.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/5.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/5.61 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.61 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.61 % Starting sh5l with 300s (1) cores
% 0.22/5.61 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1863136 completed with status 0
% 0.22/5.61 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/5.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/5.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/5.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.61 % No SInE strategy applied
% 0.22/5.61 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/5.61 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.61 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/5.61 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/5.61 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.22/5.61 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.22/5.61 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1863144 completed with status 0
% 0.22/5.61 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.22/5.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/5.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/5.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.61 % No SInE strategy applied
% 0.22/5.61 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/5.61 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.61 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/5.61 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/5.61 % Preprocessing time : 0.003 s
% 0.22/5.61 % Presaturation interreduction done
% 0.22/5.61
% 0.22/5.61 % Proof found!
% 0.22/5.61 % SZS status Unsatisfiable
% 0.22/5.61 % SZS output start CNFRefutation
% See solution above
% 0.22/5.61 % Parsed axioms : 197
% 0.22/5.61 % Removed by relevancy pruning/SinE : 0
% 0.22/5.61 % Initial clauses : 197
% 0.22/5.61 % Removed in clause preprocessing : 0
% 0.22/5.61 % Initial clauses in saturation : 197
% 0.22/5.61 % Processed clauses : 429
% 0.22/5.61 % ...of these trivial : 2
% 0.22/5.61 % ...subsumed : 13
% 0.22/5.61 % ...remaining for further processing : 414
% 0.22/5.61 % Other redundant clauses eliminated : 82
% 0.22/5.61 % Clauses deleted for lack of memory : 0
% 0.22/5.61 % Backward-subsumed : 2
% 0.22/5.61 % Backward-rewritten : 20
% 0.22/5.61 % Generated clauses : 945
% 0.22/5.61 % ...of the previous two non-redundant : 795
% 0.22/5.61 % ...aggressively subsumed : 0
% 0.22/5.61 % Contextual simplify-reflections : 4
% 0.22/5.61 % Paramodulations : 843
% 0.22/5.61 % Factorizations : 0
% 0.22/5.61 % NegExts : 0
% 0.22/5.61 % Equation resolutions : 99
% 0.22/5.61 % Disequality decompositions : 0
% 0.22/5.61 % Total rewrite steps : 713
% 0.22/5.61 % ...of those cached : 605
% 0.22/5.61 % Propositional unsat checks : 0
% 0.22/5.62 % Propositional check models : 0
% 0.22/5.62 % Propositional check unsatisfiable : 0
% 0.22/5.62 % Propositional clauses : 0
% 0.22/5.62 % Propositional clauses after purity: 0
% 0.22/5.62 % Propositional unsat core size : 0
% 0.22/5.62 % Propositional preprocessing time : 0.000
% 0.22/5.62 % Propositional encoding time : 0.000
% 0.22/5.62 % Propositional solver time : 0.000
% 0.22/5.62 % Success case prop preproc time : 0.000
% 0.22/5.62 % Success case prop encoding time : 0.000
% 0.22/5.62 % Success case prop solver time : 0.000
% 0.22/5.62 % Current number of processed clauses : 193
% 0.22/5.62 % Positive orientable unit clauses : 57
% 0.22/5.62 % Positive unorientable unit clauses: 0
% 0.22/5.62 % Negative unit clauses : 2
% 0.22/5.62 % Non-unit-clauses : 134
% 0.22/5.62 % Current number of unprocessed clauses: 730
% 0.22/5.62 % ...number of literals in the above : 4920
% 0.22/5.62 % Current number of archived formulas : 0
% 0.22/5.62 % Current number of archived clauses : 215
% 0.22/5.62 % Clause-clause subsumption calls (NU) : 11119
% 0.22/5.62 % Rec. Clause-clause subsumption calls : 1592
% 0.22/5.62 % Non-unit clause-clause subsumptions : 19
% 0.22/5.62 % Unit Clause-clause subsumption calls : 64
% 0.22/5.62 % Rewrite failures with RHS unbound : 0
% 0.22/5.62 % BW rewrite match attempts : 2
% 0.22/5.62 % BW rewrite match successes : 2
% 0.22/5.62 % Condensation attempts : 0
% 0.22/5.62 % Condensation successes : 0
% 0.22/5.62 % Termbank termtop insertions : 27344
% 0.22/5.62 % Search garbage collected termcells : 550
% 0.22/5.62
% 0.22/5.62 % -------------------------------------------------
% 0.22/5.62 % User time : 0.040 s
% 0.22/5.62 % System time : 0.010 s
% 0.22/5.62 % Total time : 0.050 s
% 0.22/5.62 % Maximum resident set size: 3812 pages
% 0.22/5.62
% 0.22/5.62 % -------------------------------------------------
% 0.22/5.62 % User time : 0.167 s
% 0.22/5.62 % System time : 0.032 s
% 0.22/5.62 % Total time : 0.199 s
% 0.22/5.62 % Maximum resident set size: 4864 pages
% 0.22/5.62 % E exiting
%------------------------------------------------------------------------------