%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC324-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:45:52 PM UTC 2026
% Result : Unsatisfiable 0.28s 0.72s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of clauses : 58 ( 18 unt; 3 nHn; 52 RR)
% Number of literals : 152 ( 60 equ; 98 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 71 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
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(co1_7,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_9,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
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(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(c_0_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_18,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_19,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_22,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_17 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_26,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_29,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_19 ).
cnf(c_0_30,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_20 ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_21 ).
cnf(c_0_33,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_22 ).
cnf(c_0_34,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]),c_0_24])]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_25 ).
cnf(c_0_36,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk4
| app(X1,cons(X2,nil)) = sk1 ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_28 ).
cnf(c_0_39,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X2,X1) != sk4
| app(X1,X2) != sk1 ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(app(cons(X1,nil),X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_24])]) ).
cnf(c_0_43,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_44,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_36 ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| app(X1,X2) != sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]) ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24])]) ).
cnf(c_0_47,plain,
( ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_24])]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_50,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_48 ).
cnf(c_0_53,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_54,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_55,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_49,c_0_30]) ).
cnf(c_0_56,negated_conjecture,
nil != sk4,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_34]),c_0_24])]),c_0_50]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_51,c_0_52]),c_0_53]),c_0_54])])]),c_0_55])]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC324-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n005.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Mon Sep 21 08:15:18 UTC 2026
% 0.19/0.49 % CPUTime :
% 0.19/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.57 Running first-order theorem proving
% 0.23/0.57 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.28/0.72 % Version: 3.5.1
% 0.28/0.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.72 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.72 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.72 % Starting sh5l with 300s (1) cores
% 0.28/0.72 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2991156 completed with status 0
% 0.28/0.72 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.28/0.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.72 % No SInE strategy applied
% 0.28/0.72 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.28/0.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.28/0.72 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.28/0.72 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.28/0.72 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.28/0.72 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2991165 completed with status 0
% 0.28/0.72 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.28/0.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.72 % No SInE strategy applied
% 0.28/0.72 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.28/0.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.28/0.72 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.28/0.72 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.28/0.72 % Preprocessing time : 0.005 s
% 0.28/0.72
% 0.28/0.72 % Proof found!
% 0.28/0.72 % SZS status Unsatisfiable
% 0.28/0.72 % SZS output start CNFRefutation
% See solution above
% 0.28/0.72 % Parsed axioms : 194
% 0.28/0.72 % Removed by relevancy pruning/SinE : 0
% 0.28/0.72 % Initial clauses : 194
% 0.28/0.72 % Removed in clause preprocessing : 0
% 0.28/0.72 % Initial clauses in saturation : 194
% 0.28/0.72 % Processed clauses : 661
% 0.28/0.72 % ...of these trivial : 2
% 0.28/0.72 % ...subsumed : 293
% 0.28/0.72 % ...remaining for further processing : 366
% 0.28/0.72 % Other redundant clauses eliminated : 156
% 0.28/0.72 % Clauses deleted for lack of memory : 0
% 0.28/0.72 % Backward-subsumed : 9
% 0.28/0.72 % Backward-rewritten : 12
% 0.28/0.72 % Generated clauses : 1550
% 0.28/0.72 % ...of the previous two non-redundant : 1261
% 0.28/0.72 % ...aggressively subsumed : 0
% 0.28/0.72 % Contextual simplify-reflections : 21
% 0.28/0.72 % Paramodulations : 1387
% 0.28/0.72 % Factorizations : 0
% 0.28/0.72 % NegExts : 0
% 0.28/0.72 % Equation resolutions : 164
% 0.28/0.72 % Disequality decompositions : 0
% 0.28/0.72 % Total rewrite steps : 1404
% 0.28/0.72 % ...of those cached : 1314
% 0.28/0.72 % Propositional unsat checks : 0
% 0.28/0.72 % Propositional check models : 0
% 0.28/0.72 % Propositional check unsatisfiable : 0
% 0.28/0.72 % Propositional clauses : 0
% 0.28/0.72 % Propositional clauses after purity: 0
% 0.28/0.72 % Propositional unsat core size : 0
% 0.28/0.72 % Propositional preprocessing time : 0.000
% 0.28/0.72 % Propositional encoding time : 0.000
% 0.28/0.72 % Propositional solver time : 0.000
% 0.28/0.72 % Success case prop preproc time : 0.000
% 0.28/0.72 % Success case prop encoding time : 0.000
% 0.28/0.72 % Success case prop solver time : 0.000
% 0.28/0.72 % Current number of processed clauses : 322
% 0.28/0.72 % Positive orientable unit clauses : 64
% 0.28/0.72 % Positive unorientable unit clauses: 0
% 0.28/0.72 % Negative unit clauses : 12
% 0.28/0.72 % Non-unit-clauses : 246
% 0.28/0.72 % Current number of unprocessed clauses: 744
% 0.28/0.72 % ...number of literals in the above : 4404
% 0.28/0.72 % Current number of archived formulas : 0
% 0.28/0.72 % Current number of archived clauses : 21
% 0.28/0.72 % Clause-clause subsumption calls (NU) : 13804
% 0.28/0.72 % Rec. Clause-clause subsumption calls : 3364
% 0.28/0.72 % Non-unit clause-clause subsumptions : 216
% 0.28/0.72 % Unit Clause-clause subsumption calls : 274
% 0.28/0.72 % Rewrite failures with RHS unbound : 0
% 0.28/0.72 % BW rewrite match attempts : 5
% 0.28/0.72 % BW rewrite match successes : 5
% 0.28/0.72 % Condensation attempts : 0
% 0.28/0.72 % Condensation successes : 0
% 0.28/0.72 % Termbank termtop insertions : 35137
% 0.28/0.72 % Search garbage collected termcells : 542
% 0.28/0.72
% 0.28/0.72 % -------------------------------------------------
% 0.28/0.72 % User time : 0.090 s
% 0.28/0.72 % System time : 0.009 s
% 0.28/0.72 % Total time : 0.099 s
% 0.28/0.72 % Maximum resident set size: 4064 pages
% 0.28/0.72
% 0.28/0.72 % -------------------------------------------------
% 0.28/0.72 % User time : 0.389 s
% 0.28/0.72 % System time : 0.040 s
% 0.28/0.72 % Total time : 0.429 s
% 0.28/0.72 % Maximum resident set size: 4864 pages
% 0.28/0.72 % E exiting
%------------------------------------------------------------------------------