%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC407-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 : n008.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:46:13 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.48s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 18 unt; 11 nHn; 32 RR)
% Number of literals : 60 ( 20 equ; 24 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| memberP(sk4,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(c_0_11,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_12,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_13,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_14,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
co1_14 ).
cnf(c_0_16,axiom,
ssList(nil),
clause8 ).
cnf(c_0_17,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_11 ).
cnf(c_0_18,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
~ memberP(sk2,sk5),
c_0_13 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1)
| sk6 = X1
| sk3 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_26,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( sk3 = nil
| sk5 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
( nil = sk3
| memberP(sk4,sk6) ),
co1_15 ).
cnf(c_0_29,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC407-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.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:22:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.48 % Version: 3.5.1
% 0.10/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.48 % Starting sh5l with 300s (1) cores
% 0.10/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 571099 completed with status 0
% 0.10/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.10/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.48 % No SInE strategy applied
% 0.10/0.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.10/0.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.48 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.10/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.10/0.48 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 571107 completed with status 0
% 0.10/0.48 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.10/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.48 % No SInE strategy applied
% 0.10/0.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.10/0.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.48 % Preprocessing time : 0.002 s
% 0.10/0.48 % Presaturation interreduction done
% 0.10/0.48
% 0.10/0.48 % Proof found!
% 0.10/0.48 % SZS status Unsatisfiable
% 0.10/0.48 % SZS output start CNFRefutation
% See solution above
% 0.10/0.48 % Parsed axioms : 200
% 0.10/0.48 % Removed by relevancy pruning/SinE : 0
% 0.10/0.48 % Initial clauses : 200
% 0.10/0.48 % Removed in clause preprocessing : 0
% 0.10/0.48 % Initial clauses in saturation : 200
% 0.10/0.48 % Processed clauses : 638
% 0.10/0.48 % ...of these trivial : 4
% 0.10/0.48 % ...subsumed : 123
% 0.10/0.48 % ...remaining for further processing : 511
% 0.10/0.48 % Other redundant clauses eliminated : 82
% 0.10/0.48 % Clauses deleted for lack of memory : 0
% 0.10/0.48 % Backward-subsumed : 3
% 0.10/0.48 % Backward-rewritten : 80
% 0.10/0.48 % Generated clauses : 1302
% 0.10/0.48 % ...of the previous two non-redundant : 1157
% 0.10/0.48 % ...aggressively subsumed : 0
% 0.10/0.48 % Contextual simplify-reflections : 46
% 0.10/0.48 % Paramodulations : 1200
% 0.10/0.48 % Factorizations : 0
% 0.10/0.48 % NegExts : 0
% 0.10/0.48 % Equation resolutions : 99
% 0.10/0.48 % Disequality decompositions : 0
% 0.10/0.48 % Total rewrite steps : 1035
% 0.10/0.48 % ...of those cached : 909
% 0.10/0.48 % Propositional unsat checks : 0
% 0.10/0.48 % Propositional check models : 0
% 0.10/0.48 % Propositional check unsatisfiable : 0
% 0.10/0.48 % Propositional clauses : 0
% 0.10/0.48 % Propositional clauses after purity: 0
% 0.10/0.48 % Propositional unsat core size : 0
% 0.10/0.48 % Propositional preprocessing time : 0.000
% 0.10/0.48 % Propositional encoding time : 0.000
% 0.10/0.48 % Propositional solver time : 0.000
% 0.10/0.48 % Success case prop preproc time : 0.000
% 0.10/0.48 % Success case prop encoding time : 0.000
% 0.10/0.48 % Success case prop solver time : 0.000
% 0.10/0.48 % Current number of processed clauses : 226
% 0.10/0.48 % Positive orientable unit clauses : 58
% 0.10/0.48 % Positive unorientable unit clauses: 0
% 0.10/0.48 % Negative unit clauses : 2
% 0.10/0.48 % Non-unit-clauses : 166
% 0.10/0.48 % Current number of unprocessed clauses: 914
% 0.10/0.48 % ...number of literals in the above : 6111
% 0.10/0.48 % Current number of archived formulas : 0
% 0.10/0.48 % Current number of archived clauses : 279
% 0.10/0.48 % Clause-clause subsumption calls (NU) : 14289
% 0.10/0.48 % Rec. Clause-clause subsumption calls : 2873
% 0.10/0.48 % Non-unit clause-clause subsumptions : 168
% 0.10/0.48 % Unit Clause-clause subsumption calls : 136
% 0.10/0.48 % Rewrite failures with RHS unbound : 0
% 0.10/0.48 % BW rewrite match attempts : 2
% 0.10/0.48 % BW rewrite match successes : 2
% 0.10/0.48 % Condensation attempts : 0
% 0.10/0.48 % Condensation successes : 0
% 0.10/0.48 % Termbank termtop insertions : 33017
% 0.10/0.48 % Search garbage collected termcells : 529
% 0.10/0.48
% 0.10/0.48 % -------------------------------------------------
% 0.10/0.48 % User time : 0.036 s
% 0.10/0.48 % System time : 0.005 s
% 0.10/0.48 % Total time : 0.042 s
% 0.10/0.48 % Maximum resident set size: 4068 pages
% 0.10/0.48
% 0.10/0.48 % -------------------------------------------------
% 0.10/0.48 % User time : 0.174 s
% 0.10/0.48 % System time : 0.030 s
% 0.10/0.48 % Total time : 0.204 s
% 0.10/0.48 % Maximum resident set size: 5120 pages
% 0.10/0.48 % E exiting
%------------------------------------------------------------------------------