%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC239-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 : n018.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:36 PM UTC 2026
% Result : Unsatisfiable 1.27s 0.66s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 13 unt; 4 nHn; 38 RR)
% Number of literals : 92 ( 30 equ; 60 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_10,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X3,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_18,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_8,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
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(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(c_0_11,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_12,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X3,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_13,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
co1_18 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
nil != sk1,
c_0_11 ).
cnf(c_0_16,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_17,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X3,sk5(X3,X2,X1)) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
sk1 = cons(sk6,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_20,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| app(app(X2,cons(X3,nil)),X1) != cons(sk6,nil)
| memberP(X1,sk5(X1,X2,X3)) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
ssList(nil),
clause8 ).
cnf(c_0_23,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssItem(sk5(nil,X1,X2))
| app(app(X1,cons(X2,nil)),nil) != cons(sk6,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| app(app(X2,cons(X3,nil)),X1) != cons(sk6,nil)
| ssItem(sk5(X1,X2,X3)) ),
inference(rw,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(app(X1,cons(X2,nil)),nil) != cons(sk6,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_26 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| app(cons(X1,nil),nil) != cons(sk6,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_33,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_14 ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,nil) != cons(sk6,nil) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
ssList(cons(sk6,nil)),
inference(rw,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_36,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_14]),c_0_15]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC239-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.13/0.37 % Computer : n018.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 08:09:28 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 1.27/0.66 % Version: 3.5.1
% 1.27/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.27/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.27/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.27/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.27/0.66 % Starting sh5l with 300s (1) cores
% 1.27/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1412712 completed with status 0
% 1.27/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.27/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.27/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.27/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.27/0.66 % No SInE strategy applied
% 1.27/0.66 % Search class: FGHSM-FSLM31-MFFFFFNN
% 1.27/0.66 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 1.27/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.27/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.27/0.66 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 1.27/0.66 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 1.27/0.66 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.27/0.66 % G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 1412721 completed with status 0
% 1.27/0.66 % Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 1.27/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.27/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.27/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.27/0.66 % No SInE strategy applied
% 1.27/0.66 % Search class: FGHSM-FSLM31-MFFFFFNN
% 1.27/0.66 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 1.27/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.27/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.27/0.66 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 1.27/0.66 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 1.27/0.66 % Preprocessing time : 0.006 s
% 1.27/0.66 % Presaturation interreduction done
% 1.27/0.66
% 1.27/0.66 % Proof found!
% 1.27/0.66 % SZS status Unsatisfiable
% 1.27/0.66 % SZS output start CNFRefutation
% See solution above
% 1.27/0.66 % Parsed axioms : 205
% 1.27/0.66 % Removed by relevancy pruning/SinE : 0
% 1.27/0.66 % Initial clauses : 205
% 1.27/0.66 % Removed in clause preprocessing : 0
% 1.27/0.66 % Initial clauses in saturation : 205
% 1.27/0.66 % Processed clauses : 445
% 1.27/0.66 % ...of these trivial : 4
% 1.27/0.66 % ...subsumed : 19
% 1.27/0.66 % ...remaining for further processing : 422
% 1.27/0.66 % Other redundant clauses eliminated : 82
% 1.27/0.66 % Clauses deleted for lack of memory : 0
% 1.27/0.66 % Backward-subsumed : 4
% 1.27/0.66 % Backward-rewritten : 3
% 1.27/0.66 % Generated clauses : 899
% 1.27/0.66 % ...of the previous two non-redundant : 743
% 1.27/0.66 % ...aggressively subsumed : 0
% 1.27/0.66 % Contextual simplify-reflections : 4
% 1.27/0.66 % Paramodulations : 799
% 1.27/0.66 % Factorizations : 0
% 1.27/0.66 % NegExts : 0
% 1.27/0.66 % Equation resolutions : 99
% 1.27/0.66 % Disequality decompositions : 0
% 1.27/0.66 % Total rewrite steps : 701
% 1.27/0.66 % ...of those cached : 590
% 1.27/0.66 % Propositional unsat checks : 0
% 1.27/0.66 % Propositional check models : 0
% 1.27/0.66 % Propositional check unsatisfiable : 0
% 1.27/0.66 % Propositional clauses : 0
% 1.27/0.66 % Propositional clauses after purity: 0
% 1.27/0.66 % Propositional unsat core size : 0
% 1.27/0.66 % Propositional preprocessing time : 0.000
% 1.27/0.66 % Propositional encoding time : 0.000
% 1.27/0.66 % Propositional solver time : 0.000
% 1.27/0.66 % Success case prop preproc time : 0.000
% 1.27/0.66 % Success case prop encoding time : 0.000
% 1.27/0.66 % Success case prop solver time : 0.000
% 1.27/0.66 % Current number of processed clauses : 213
% 1.27/0.66 % Positive orientable unit clauses : 59
% 1.27/0.66 % Positive unorientable unit clauses: 0
% 1.27/0.66 % Negative unit clauses : 3
% 1.27/0.66 % Non-unit-clauses : 151
% 1.27/0.66 % Current number of unprocessed clauses: 698
% 1.27/0.66 % ...number of literals in the above : 4675
% 1.27/0.66 % Current number of archived formulas : 0
% 1.27/0.66 % Current number of archived clauses : 204
% 1.27/0.66 % Clause-clause subsumption calls (NU) : 11435
% 1.27/0.66 % Rec. Clause-clause subsumption calls : 1490
% 1.27/0.66 % Non-unit clause-clause subsumptions : 25
% 1.27/0.66 % Unit Clause-clause subsumption calls : 19
% 1.27/0.66 % Rewrite failures with RHS unbound : 0
% 1.27/0.66 % BW rewrite match attempts : 2
% 1.27/0.66 % BW rewrite match successes : 2
% 1.27/0.66 % Condensation attempts : 0
% 1.27/0.66 % Condensation successes : 0
% 1.27/0.66 % Termbank termtop insertions : 27763
% 1.27/0.66 % Search garbage collected termcells : 563
% 1.27/0.66
% 1.27/0.66 % -------------------------------------------------
% 1.27/0.66 % User time : 0.085 s
% 1.27/0.66 % System time : 0.009 s
% 1.27/0.66 % Total time : 0.094 s
% 1.27/0.66 % Maximum resident set size: 4072 pages
% 1.27/0.66
% 1.27/0.66 % -------------------------------------------------
% 1.27/0.66 % User time : 0.553 s
% 1.27/0.66 % System time : 0.052 s
% 1.27/0.66 % Total time : 0.605 s
% 1.27/0.66 % Maximum resident set size: 5120 pages
% 1.27/0.66 % E exiting
%------------------------------------------------------------------------------