%------------------------------------------------------------------------------
% File : E---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 : n002.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:56 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.62s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 19 unt; 3 nHn; 39 RR)
% Number of literals : 101 ( 50 equ; 63 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
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(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_13,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_15,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_16,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_17,negated_conjecture,
( app(X2,X1) != sk1
| app(X1,X2) != sk2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_14 ).
cnf(c_0_21,axiom,
ssList(nil),
clause8 ).
cnf(c_0_22,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_23,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_15 ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_16 ).
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(X2)
| ~ ssList(X1)
| app(X2,X1) != sk4
| app(X1,X2) != sk3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_28,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]),c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_22 ).
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_19]) ).
cnf(c_0_35,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]),c_0_21])]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
app(skaf82(sk4),cons(skaf83(sk4),nil)) = sk3,
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_30,c_0_31]),c_0_32]),c_0_33])])]),c_0_34])]),c_0_35]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(cons(skaf83(sk4),nil))
| app(cons(skaf83(sk4),nil),skaf82(sk4)) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_36]),c_0_33])]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_37 ).
cnf(c_0_40,negated_conjecture,
app(cons(skaf83(sk4),nil),skaf82(sk4)) != sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32]),c_0_21])]) ).
cnf(c_0_41,negated_conjecture,
cons(skaf83(sk4),skaf82(sk4)) != sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_32]),c_0_33])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_34])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC324-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.14/0.38 % Computer : n002.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Sep 21 08:18:17 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.47 Running first-order theorem proving
% 0.16/0.47 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.21/0.62 % Version: 3.5.1
% 0.21/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.62 % Starting sh5l with 300s (1) cores
% 0.21/0.62 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2849570 completed with status 0
% 0.21/0.62 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.62 % No SInE strategy applied
% 0.21/0.62 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.62 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.62 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.62 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.62 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2849577 completed with status 0
% 0.21/0.62 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.62 % No SInE strategy applied
% 0.21/0.62 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.62 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.62 % Preprocessing time : 0.005 s
% 0.21/0.62 % Presaturation interreduction done
% 0.21/0.62
% 0.21/0.62 % Proof found!
% 0.21/0.62 % SZS status Unsatisfiable
% 0.21/0.62 % SZS output start CNFRefutation
% See solution above
% 0.21/0.62 % Parsed axioms : 194
% 0.21/0.62 % Removed by relevancy pruning/SinE : 0
% 0.21/0.62 % Initial clauses : 194
% 0.21/0.62 % Removed in clause preprocessing : 0
% 0.21/0.62 % Initial clauses in saturation : 194
% 0.21/0.62 % Processed clauses : 610
% 0.21/0.62 % ...of these trivial : 2
% 0.21/0.62 % ...subsumed : 122
% 0.21/0.62 % ...remaining for further processing : 486
% 0.21/0.62 % Other redundant clauses eliminated : 149
% 0.21/0.62 % Clauses deleted for lack of memory : 0
% 0.21/0.62 % Backward-subsumed : 12
% 0.21/0.62 % Backward-rewritten : 9
% 0.21/0.62 % Generated clauses : 1133
% 0.21/0.62 % ...of the previous two non-redundant : 905
% 0.21/0.62 % ...aggressively subsumed : 0
% 0.21/0.62 % Contextual simplify-reflections : 12
% 0.21/0.62 % Paramodulations : 980
% 0.21/0.62 % Factorizations : 0
% 0.21/0.62 % NegExts : 0
% 0.21/0.62 % Equation resolutions : 154
% 0.21/0.62 % Disequality decompositions : 0
% 0.21/0.62 % Total rewrite steps : 1172
% 0.21/0.62 % ...of those cached : 1082
% 0.21/0.62 % Propositional unsat checks : 0
% 0.21/0.62 % Propositional check models : 0
% 0.21/0.62 % Propositional check unsatisfiable : 0
% 0.21/0.62 % Propositional clauses : 0
% 0.21/0.62 % Propositional clauses after purity: 0
% 0.21/0.62 % Propositional unsat core size : 0
% 0.21/0.62 % Propositional preprocessing time : 0.000
% 0.21/0.62 % Propositional encoding time : 0.000
% 0.21/0.62 % Propositional solver time : 0.000
% 0.21/0.62 % Success case prop preproc time : 0.000
% 0.21/0.62 % Success case prop encoding time : 0.000
% 0.21/0.62 % Success case prop solver time : 0.000
% 0.21/0.62 % Current number of processed clauses : 256
% 0.21/0.62 % Positive orientable unit clauses : 66
% 0.21/0.62 % Positive unorientable unit clauses: 0
% 0.21/0.62 % Negative unit clauses : 13
% 0.21/0.62 % Non-unit-clauses : 177
% 0.21/0.62 % Current number of unprocessed clauses: 643
% 0.21/0.62 % ...number of literals in the above : 3772
% 0.21/0.62 % Current number of archived formulas : 0
% 0.21/0.62 % Current number of archived clauses : 207
% 0.21/0.62 % Clause-clause subsumption calls (NU) : 15231
% 0.21/0.62 % Rec. Clause-clause subsumption calls : 2428
% 0.21/0.62 % Non-unit clause-clause subsumptions : 80
% 0.21/0.62 % Unit Clause-clause subsumption calls : 470
% 0.21/0.62 % Rewrite failures with RHS unbound : 0
% 0.21/0.62 % BW rewrite match attempts : 5
% 0.21/0.62 % BW rewrite match successes : 5
% 0.21/0.62 % Condensation attempts : 0
% 0.21/0.62 % Condensation successes : 0
% 0.21/0.62 % Termbank termtop insertions : 31520
% 0.21/0.62 % Search garbage collected termcells : 542
% 0.21/0.62
% 0.21/0.62 % -------------------------------------------------
% 0.21/0.62 % User time : 0.090 s
% 0.21/0.62 % System time : 0.011 s
% 0.21/0.62 % Total time : 0.101 s
% 0.21/0.62 % Maximum resident set size: 4064 pages
% 0.21/0.62
% 0.21/0.62 % -------------------------------------------------
% 0.21/0.62 % User time : 0.416 s
% 0.21/0.62 % System time : 0.040 s
% 0.21/0.62 % Total time : 0.456 s
% 0.21/0.62 % Maximum resident set size: 5120 pages
% 0.21/0.62 % E exiting
%------------------------------------------------------------------------------