%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC149-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 : n009.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:13 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.72s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 51 ( 18 unt; 5 nHn; 47 RR)
% Number of literals : 134 ( 36 equ; 94 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
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(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
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(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_9,negated_conjecture,
~ singletonP(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_14,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_15,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_14 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2 ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_17 ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(cons(X2,nil))
| ~ ssItem(X1)
| ~ ssItem(X2)
| app(cons(X1,cons(X2,nil)),X3) != sk2 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_20 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,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_25,negated_conjecture,
( ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| app(cons(X1,cons(X2,nil)),X3) != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(cons(X2,nil))
| ~ ssItem(X1)
| ~ ssItem(X2)
| cons(X1,app(cons(X2,nil),X3)) != sk2 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| cons(X1,app(cons(X2,nil),X3)) != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_23])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| cons(X1,cons(X2,X3)) != sk2 ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_29 ).
cnf(c_0_33,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_34,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != sk2
| nil = X1 ),
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_37,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_38,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( sk2 = nil
| skaf82(sk2) = nil ),
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_36,c_0_32]),c_0_33]),c_0_34])])]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
~ singletonP(sk2),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_22]),c_0_23])]) ).
cnf(c_0_43,negated_conjecture,
( sk2 = nil
| cons(skaf83(sk2),nil) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_39]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
~ singletonP(sk2),
c_0_40 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_41 ).
cnf(c_0_46,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_47,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_33])]),c_0_44]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC149-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.10/0.57 % Computer : n009.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Mon Sep 21 07:59:13 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.62 Running first-order theorem proving
% 0.14/0.62 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/0.72 % Version: 3.5.1
% 0.14/0.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.72 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.72 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.72 % Starting sh5l with 300s (1) cores
% 0.14/0.72 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1261103 completed with status 0
% 0.14/0.72 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.72 % No SInE strategy applied
% 0.14/0.72 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.72 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.72 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.72 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.72 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1261113 completed with status 0
% 0.14/0.72 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.72 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.72 % No SInE strategy applied
% 0.14/0.72 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.72 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.72 % Preprocessing time : 0.004 s
% 0.14/0.72 % Presaturation interreduction done
% 0.14/0.72
% 0.14/0.72 % Proof found!
% 0.14/0.72 % SZS status Unsatisfiable
% 0.14/0.72 % SZS output start CNFRefutation
% See solution above
% 0.14/0.72 % Parsed axioms : 194
% 0.14/0.72 % Removed by relevancy pruning/SinE : 0
% 0.14/0.72 % Initial clauses : 194
% 0.14/0.72 % Removed in clause preprocessing : 0
% 0.14/0.72 % Initial clauses in saturation : 194
% 0.14/0.72 % Processed clauses : 768
% 0.14/0.72 % ...of these trivial : 3
% 0.14/0.72 % ...subsumed : 238
% 0.14/0.72 % ...remaining for further processing : 527
% 0.14/0.72 % Other redundant clauses eliminated : 158
% 0.14/0.72 % Clauses deleted for lack of memory : 0
% 0.14/0.72 % Backward-subsumed : 10
% 0.14/0.72 % Backward-rewritten : 47
% 0.14/0.72 % Generated clauses : 1793
% 0.14/0.72 % ...of the previous two non-redundant : 1523
% 0.14/0.72 % ...aggressively subsumed : 0
% 0.14/0.72 % Contextual simplify-reflections : 19
% 0.14/0.72 % Paramodulations : 1631
% 0.14/0.72 % Factorizations : 0
% 0.14/0.72 % NegExts : 0
% 0.14/0.72 % Equation resolutions : 163
% 0.14/0.72 % Disequality decompositions : 0
% 0.14/0.72 % Total rewrite steps : 1716
% 0.14/0.72 % ...of those cached : 1621
% 0.14/0.72 % Propositional unsat checks : 0
% 0.14/0.72 % Propositional check models : 0
% 0.14/0.72 % Propositional check unsatisfiable : 0
% 0.14/0.72 % Propositional clauses : 0
% 0.14/0.72 % Propositional clauses after purity: 0
% 0.14/0.72 % Propositional unsat core size : 0
% 0.14/0.72 % Propositional preprocessing time : 0.000
% 0.14/0.72 % Propositional encoding time : 0.000
% 0.14/0.72 % Propositional solver time : 0.000
% 0.14/0.72 % Success case prop preproc time : 0.000
% 0.14/0.72 % Success case prop encoding time : 0.000
% 0.14/0.72 % Success case prop solver time : 0.000
% 0.14/0.72 % Current number of processed clauses : 261
% 0.14/0.72 % Positive orientable unit clauses : 65
% 0.14/0.72 % Positive unorientable unit clauses: 0
% 0.14/0.72 % Negative unit clauses : 2
% 0.14/0.72 % Non-unit-clauses : 194
% 0.14/0.72 % Current number of unprocessed clauses: 1089
% 0.14/0.72 % ...number of literals in the above : 6595
% 0.14/0.72 % Current number of archived formulas : 0
% 0.14/0.72 % Current number of archived clauses : 243
% 0.14/0.72 % Clause-clause subsumption calls (NU) : 18012
% 0.14/0.72 % Rec. Clause-clause subsumption calls : 3508
% 0.14/0.72 % Non-unit clause-clause subsumptions : 183
% 0.14/0.72 % Unit Clause-clause subsumption calls : 174
% 0.14/0.72 % Rewrite failures with RHS unbound : 0
% 0.14/0.72 % BW rewrite match attempts : 5
% 0.14/0.72 % BW rewrite match successes : 5
% 0.14/0.72 % Condensation attempts : 0
% 0.14/0.72 % Condensation successes : 0
% 0.14/0.72 % Termbank termtop insertions : 42841
% 0.14/0.72 % Search garbage collected termcells : 534
% 0.14/0.72
% 0.14/0.72 % -------------------------------------------------
% 0.14/0.72 % User time : 0.074 s
% 0.14/0.72 % System time : 0.006 s
% 0.14/0.72 % Total time : 0.080 s
% 0.14/0.72 % Maximum resident set size: 4064 pages
% 0.14/0.72
% 0.14/0.72 % -------------------------------------------------
% 0.14/0.72 % User time : 0.351 s
% 0.14/0.72 % System time : 0.038 s
% 0.14/0.72 % Total time : 0.389 s
% 0.14/0.72 % Maximum resident set size: 4864 pages
% 0.14/0.72 % E exiting
%------------------------------------------------------------------------------