%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC025-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 : n026.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:42:40 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 17 unt; 7 nHn; 39 RR)
% Number of literals : 90 ( 31 equ; 49 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(co1_8,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| memberP(sk4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( nil = sk1
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
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(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
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_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_13,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_14,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| memberP(sk4,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_15,negated_conjecture,
( nil = sk1
| nil = sk2 ),
co1_10 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_19,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_13 ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_21,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| memberP(sk4,X1) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
( sk3 = nil
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_23,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_18 ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_20 ).
cnf(c_0_26,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_27,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_30,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| memberP(X1,skaf83(X1))
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| memberP(sk3,X1) ),
c_0_30 ).
cnf(c_0_36,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_38,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_16]),c_0_17]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_23]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_41,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_26]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC025-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.09/5.37 % Computer : n026.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 07:52:58 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.49 % Version: 3.5.1
% 0.15/5.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.49 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.49 % Starting sh5l with 300s (1) cores
% 0.15/5.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1772880 completed with status 0
% 0.15/5.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/5.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.49 % No SInE strategy applied
% 0.15/5.49 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/5.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.49 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.49 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.49 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.15/5.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/5.49 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1772888 completed with status 0
% 0.15/5.49 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.15/5.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.49 % No SInE strategy applied
% 0.15/5.49 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/5.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.49 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/5.49 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.49 % Preprocessing time : 0.004 s
% 0.15/5.49 % Presaturation interreduction done
% 0.15/5.49
% 0.15/5.49 % Proof found!
% 0.15/5.49 % SZS status Unsatisfiable
% 0.15/5.49 % SZS output start CNFRefutation
% See solution above
% 0.15/5.50 % Parsed axioms : 198
% 0.15/5.50 % Removed by relevancy pruning/SinE : 0
% 0.15/5.50 % Initial clauses : 198
% 0.15/5.50 % Removed in clause preprocessing : 2
% 0.15/5.50 % Initial clauses in saturation : 196
% 0.15/5.50 % Processed clauses : 464
% 0.15/5.50 % ...of these trivial : 2
% 0.15/5.50 % ...subsumed : 35
% 0.15/5.50 % ...remaining for further processing : 427
% 0.15/5.50 % Other redundant clauses eliminated : 91
% 0.15/5.50 % Clauses deleted for lack of memory : 0
% 0.15/5.50 % Backward-subsumed : 1
% 0.15/5.50 % Backward-rewritten : 14
% 0.15/5.50 % Generated clauses : 923
% 0.15/5.50 % ...of the previous two non-redundant : 764
% 0.15/5.50 % ...aggressively subsumed : 0
% 0.15/5.50 % Contextual simplify-reflections : 7
% 0.15/5.50 % Paramodulations : 810
% 0.15/5.50 % Factorizations : 0
% 0.15/5.50 % NegExts : 0
% 0.15/5.50 % Equation resolutions : 110
% 0.15/5.50 % Disequality decompositions : 0
% 0.15/5.50 % Total rewrite steps : 740
% 0.15/5.50 % ...of those cached : 625
% 0.15/5.50 % Propositional unsat checks : 0
% 0.15/5.50 % Propositional check models : 0
% 0.15/5.50 % Propositional check unsatisfiable : 0
% 0.15/5.50 % Propositional clauses : 0
% 0.15/5.50 % Propositional clauses after purity: 0
% 0.15/5.50 % Propositional unsat core size : 0
% 0.15/5.50 % Propositional preprocessing time : 0.000
% 0.15/5.50 % Propositional encoding time : 0.000
% 0.15/5.50 % Propositional solver time : 0.000
% 0.15/5.50 % Success case prop preproc time : 0.000
% 0.15/5.50 % Success case prop encoding time : 0.000
% 0.15/5.50 % Success case prop solver time : 0.000
% 0.15/5.50 % Current number of processed clauses : 214
% 0.15/5.50 % Positive orientable unit clauses : 56
% 0.15/5.50 % Positive unorientable unit clauses: 0
% 0.15/5.50 % Negative unit clauses : 3
% 0.15/5.50 % Non-unit-clauses : 155
% 0.15/5.50 % Current number of unprocessed clauses: 687
% 0.15/5.50 % ...number of literals in the above : 4786
% 0.15/5.50 % Current number of archived formulas : 0
% 0.15/5.50 % Current number of archived clauses : 207
% 0.15/5.50 % Clause-clause subsumption calls (NU) : 11772
% 0.15/5.50 % Rec. Clause-clause subsumption calls : 1677
% 0.15/5.50 % Non-unit clause-clause subsumptions : 34
% 0.15/5.50 % Unit Clause-clause subsumption calls : 29
% 0.15/5.50 % Rewrite failures with RHS unbound : 0
% 0.15/5.50 % BW rewrite match attempts : 1
% 0.15/5.50 % BW rewrite match successes : 1
% 0.15/5.50 % Condensation attempts : 0
% 0.15/5.50 % Condensation successes : 0
% 0.15/5.50 % Termbank termtop insertions : 27716
% 0.15/5.50 % Search garbage collected termcells : 538
% 0.15/5.50
% 0.15/5.50 % -------------------------------------------------
% 0.15/5.50 % User time : 0.051 s
% 0.15/5.50 % System time : 0.005 s
% 0.15/5.50 % Total time : 0.056 s
% 0.15/5.50 % Maximum resident set size: 4068 pages
% 0.15/5.50
% 0.15/5.50 % -------------------------------------------------
% 0.15/5.50 % User time : 0.237 s
% 0.15/5.50 % System time : 0.032 s
% 0.15/5.50 % Total time : 0.269 s
% 0.15/5.50 % Maximum resident set size: 4864 pages
% 0.15/5.50 % E exiting
%------------------------------------------------------------------------------