%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC366-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 : n010.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:06 PM UTC 2026
% Result : Unsatisfiable 0.14s 15.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 55 ( 18 unt; 14 nHn; 55 RR)
% Number of literals : 157 ( 46 equ; 96 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X3
| cons(X3,nil) != X2
| ~ ssItem(X3)
| app(X2,sk3) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause143,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ rearsegP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X3
| cons(X3,nil) != X2
| ~ ssItem(X3)
| app(X2,sk3) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_16,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| hd(sk4) != X3
| cons(X3,nil) != X2
| ~ ssItem(X3)
| app(X2,sk3) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_22,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk1))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])])])])]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_21 ).
cnf(c_0_25,axiom,
ssList(nil),
clause8 ).
cnf(c_0_26,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk1))
| ~ ssItem(hd(sk4))
| nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_27 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(app(cons(hd(sk4),nil),sk1))
| nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_30 ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(app(cons(hd(sk4),nil),sk1))
| ~ ssItem(hd(sk4))
| nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(app(cons(hd(sk4),nil),sk1))
| nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_26])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
( ~ neq(sk4,nil)
| ~ rearsegP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_41,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(hd(sk4))
| nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_25])]) ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| ~ rearsegP(sk2,sk1) ),
c_0_40 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_41]),c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( nil = sk4
| app(cons(hd(sk4),nil),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_26])]) ).
cnf(c_0_46,negated_conjecture,
~ rearsegP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_17]),c_0_20])]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| nil = sk4 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37])]),c_0_46]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssItem(hd(sk4))
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_25])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_48 ).
cnf(c_0_51,negated_conjecture,
nil = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_29]),c_0_26])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
neq(sk4,sk4),
inference(rw,[status(thm)],[c_0_20,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC366-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/15.37 % Computer : n010.cluster.edu
% 0.11/15.37 % Model : x86_64 x86_64
% 0.11/15.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.37 % Memory : 8046.5625MB
% 0.11/15.37 % OS : Linux 6.8.0-71-generic
% 0.11/15.37 % CPULimit : 300
% 0.11/15.37 % WCLimit : 300
% 0.11/15.37 % DateTime : Mon Sep 21 08:19:41 UTC 2026
% 0.11/15.38 % CPUTime :
% 0.11/15.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/15.42 Running first-order theorem proving
% 0.14/15.42 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.14/15.48 % Version: 3.5.1
% 0.14/15.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/15.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/15.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/15.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/15.48 % Starting sh5l with 300s (1) cores
% 0.14/15.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 456718 completed with status 0
% 0.14/15.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/15.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/15.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/15.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/15.48 % No SInE strategy applied
% 0.14/15.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/15.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/15.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/15.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/15.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/15.48 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/15.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/15.48 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 456727 completed with status 0
% 0.14/15.48 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.14/15.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/15.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/15.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/15.48 % No SInE strategy applied
% 0.14/15.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/15.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/15.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/15.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/15.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/15.48 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/15.48 % Preprocessing time : 0.004 s
% 0.14/15.48
% 0.14/15.48 % Proof found!
% 0.14/15.48 % SZS status Unsatisfiable
% 0.14/15.48 % SZS output start CNFRefutation
% See solution above
% 0.14/15.48 % Parsed axioms : 197
% 0.14/15.48 % Removed by relevancy pruning/SinE : 0
% 0.14/15.48 % Initial clauses : 197
% 0.14/15.48 % Removed in clause preprocessing : 0
% 0.14/15.48 % Initial clauses in saturation : 197
% 0.14/15.48 % Processed clauses : 271
% 0.14/15.48 % ...of these trivial : 5
% 0.14/15.48 % ...subsumed : 26
% 0.14/15.48 % ...remaining for further processing : 240
% 0.14/15.48 % Other redundant clauses eliminated : 72
% 0.14/15.48 % Clauses deleted for lack of memory : 0
% 0.14/15.48 % Backward-subsumed : 11
% 0.14/15.48 % Backward-rewritten : 56
% 0.14/15.48 % Generated clauses : 621
% 0.14/15.48 % ...of the previous two non-redundant : 546
% 0.14/15.48 % ...aggressively subsumed : 0
% 0.14/15.48 % Contextual simplify-reflections : 5
% 0.14/15.48 % Paramodulations : 547
% 0.14/15.48 % Factorizations : 0
% 0.14/15.48 % NegExts : 0
% 0.14/15.48 % Equation resolutions : 77
% 0.14/15.48 % Disequality decompositions : 0
% 0.14/15.48 % Total rewrite steps : 515
% 0.14/15.48 % ...of those cached : 452
% 0.14/15.48 % Propositional unsat checks : 0
% 0.14/15.48 % Propositional check models : 0
% 0.14/15.48 % Propositional check unsatisfiable : 0
% 0.14/15.48 % Propositional clauses : 0
% 0.14/15.48 % Propositional clauses after purity: 0
% 0.14/15.48 % Propositional unsat core size : 0
% 0.14/15.48 % Propositional preprocessing time : 0.000
% 0.14/15.48 % Propositional encoding time : 0.000
% 0.14/15.48 % Propositional solver time : 0.000
% 0.14/15.48 % Success case prop preproc time : 0.000
% 0.14/15.48 % Success case prop encoding time : 0.000
% 0.14/15.48 % Success case prop solver time : 0.000
% 0.14/15.48 % Current number of processed clauses : 149
% 0.14/15.48 % Positive orientable unit clauses : 58
% 0.14/15.48 % Positive unorientable unit clauses: 0
% 0.14/15.48 % Negative unit clauses : 3
% 0.14/15.48 % Non-unit-clauses : 88
% 0.14/15.48 % Current number of unprocessed clauses: 470
% 0.14/15.48 % ...number of literals in the above : 2189
% 0.14/15.48 % Current number of archived formulas : 0
% 0.14/15.48 % Current number of archived clauses : 67
% 0.14/15.48 % Clause-clause subsumption calls (NU) : 5695
% 0.14/15.48 % Rec. Clause-clause subsumption calls : 898
% 0.14/15.48 % Non-unit clause-clause subsumptions : 30
% 0.14/15.48 % Unit Clause-clause subsumption calls : 454
% 0.14/15.48 % Rewrite failures with RHS unbound : 0
% 0.14/15.48 % BW rewrite match attempts : 3
% 0.14/15.48 % BW rewrite match successes : 3
% 0.14/15.48 % Condensation attempts : 0
% 0.14/15.48 % Condensation successes : 0
% 0.14/15.48 % Termbank termtop insertions : 18418
% 0.14/15.48 % Search garbage collected termcells : 557
% 0.14/15.48
% 0.14/15.48 % -------------------------------------------------
% 0.14/15.48 % User time : 0.032 s
% 0.14/15.48 % System time : 0.005 s
% 0.14/15.48 % Total time : 0.037 s
% 0.14/15.48 % Maximum resident set size: 4024 pages
% 0.14/15.48
% 0.14/15.48 % -------------------------------------------------
% 0.14/15.48 % User time : 0.148 s
% 0.14/15.48 % System time : 0.023 s
% 0.14/15.48 % Total time : 0.171 s
% 0.14/15.48 % Maximum resident set size: 5120 pages
% 0.14/15.48 % E exiting
%------------------------------------------------------------------------------