%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC419-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:44:21 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 18 unt; 0 nHn; 44 RR)
% Number of literals : 86 ( 29 equ; 49 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_13,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_19,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_13 ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk3 ),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(app(X3,cons(X2,nil)),X1) != sk4
| app(app(X1,cons(X2,nil)),X3) != sk1 ),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_22])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk1
| app(app(X1,cons(sk5,nil)),sk6) != sk4 ),
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_32,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_29 ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
c_0_30 ).
cnf(c_0_37,negated_conjecture,
app(app(nil,cons(sk5,nil)),sk6) != sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
app(cons(sk5,nil),sk6) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_22])]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_41,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_27]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC419-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.38 % Computer : n006.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Mon Sep 21 08:22:55 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/10.48 % Version: 3.5.1
% 0.15/10.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/10.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/10.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.48 % Starting sh5l with 300s (1) cores
% 0.15/10.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2412327 completed with status 0
% 0.15/10.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/10.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/10.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/10.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.48 % No SInE strategy applied
% 0.15/10.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/10.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/10.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/10.48 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.15/10.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/10.48 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2412337 completed with status 0
% 0.15/10.48 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.15/10.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/10.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/10.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.48 % No SInE strategy applied
% 0.15/10.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/10.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/10.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/10.48 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.15/10.48 % Preprocessing time : 0.004 s
% 0.15/10.48
% 0.15/10.48 % Proof found!
% 0.15/10.48 % SZS status Unsatisfiable
% 0.15/10.48 % SZS output start CNFRefutation
% See solution above
% 0.15/10.48 % Parsed axioms : 198
% 0.15/10.48 % Removed by relevancy pruning/SinE : 0
% 0.15/10.48 % Initial clauses : 198
% 0.15/10.48 % Removed in clause preprocessing : 0
% 0.15/10.48 % Initial clauses in saturation : 198
% 0.15/10.48 % Processed clauses : 248
% 0.15/10.48 % ...of these trivial : 2
% 0.15/10.48 % ...subsumed : 21
% 0.15/10.48 % ...remaining for further processing : 225
% 0.15/10.48 % Other redundant clauses eliminated : 69
% 0.15/10.48 % Clauses deleted for lack of memory : 0
% 0.15/10.48 % Backward-subsumed : 9
% 0.15/10.48 % Backward-rewritten : 2
% 0.15/10.48 % Generated clauses : 531
% 0.15/10.48 % ...of the previous two non-redundant : 419
% 0.15/10.48 % ...aggressively subsumed : 0
% 0.15/10.48 % Contextual simplify-reflections : 0
% 0.15/10.48 % Paramodulations : 458
% 0.15/10.48 % Factorizations : 0
% 0.15/10.48 % NegExts : 0
% 0.15/10.48 % Equation resolutions : 74
% 0.15/10.48 % Disequality decompositions : 0
% 0.15/10.48 % Total rewrite steps : 380
% 0.15/10.48 % ...of those cached : 316
% 0.15/10.48 % Propositional unsat checks : 0
% 0.15/10.48 % Propositional check models : 0
% 0.15/10.48 % Propositional check unsatisfiable : 0
% 0.15/10.48 % Propositional clauses : 0
% 0.15/10.48 % Propositional clauses after purity: 0
% 0.15/10.48 % Propositional unsat core size : 0
% 0.15/10.48 % Propositional preprocessing time : 0.000
% 0.15/10.48 % Propositional encoding time : 0.000
% 0.15/10.48 % Propositional solver time : 0.000
% 0.15/10.48 % Success case prop preproc time : 0.000
% 0.15/10.48 % Success case prop encoding time : 0.000
% 0.15/10.48 % Success case prop solver time : 0.000
% 0.15/10.48 % Current number of processed clauses : 191
% 0.15/10.48 % Positive orientable unit clauses : 67
% 0.15/10.48 % Positive unorientable unit clauses: 0
% 0.15/10.48 % Negative unit clauses : 6
% 0.15/10.48 % Non-unit-clauses : 118
% 0.15/10.48 % Current number of unprocessed clauses: 365
% 0.15/10.48 % ...number of literals in the above : 1786
% 0.15/10.48 % Current number of archived formulas : 0
% 0.15/10.48 % Current number of archived clauses : 11
% 0.15/10.48 % Clause-clause subsumption calls (NU) : 4712
% 0.15/10.48 % Rec. Clause-clause subsumption calls : 732
% 0.15/10.48 % Non-unit clause-clause subsumptions : 10
% 0.15/10.48 % Unit Clause-clause subsumption calls : 159
% 0.15/10.48 % Rewrite failures with RHS unbound : 0
% 0.15/10.48 % BW rewrite match attempts : 2
% 0.15/10.48 % BW rewrite match successes : 2
% 0.15/10.48 % Condensation attempts : 0
% 0.15/10.48 % Condensation successes : 0
% 0.15/10.48 % Termbank termtop insertions : 16900
% 0.15/10.48 % Search garbage collected termcells : 544
% 0.15/10.48
% 0.15/10.48 % -------------------------------------------------
% 0.15/10.48 % User time : 0.026 s
% 0.15/10.48 % System time : 0.007 s
% 0.15/10.48 % Total time : 0.033 s
% 0.15/10.48 % Maximum resident set size: 4068 pages
% 0.15/10.48
% 0.15/10.48 % -------------------------------------------------
% 0.15/10.48 % User time : 0.116 s
% 0.15/10.48 % System time : 0.023 s
% 0.15/10.48 % Total time : 0.139 s
% 0.15/10.48 % Maximum resident set size: 4864 pages
% 0.15/10.48 % E exiting
%------------------------------------------------------------------------------