%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC198-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 : n015.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:45:21 PM UTC 2026
% Result : Unsatisfiable 0.59s 0.51s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 9 unt; 9 nHn; 33 RR)
% Number of literals : 73 ( 21 equ; 38 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk1,sk5(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( nil = sk3
| ssItem(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(co1_7,negated_conjecture,
( ~ ssItem(X1)
| ssItem(sk5(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_9,negated_conjecture,
( X1 != sk5(X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause9,axiom,
ssItem(skac3),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause9) ).
cnf(c_0_10,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_11,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_12,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk1,sk5(X1)) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_13,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
co1_15 ).
cnf(c_0_15,axiom,
ssList(nil),
clause8 ).
cnf(c_0_16,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_11 ).
cnf(c_0_17,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_11 ).
cnf(c_0_18,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk1,sk5(X1)) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(X1)
| ssItem(sk5(X1)) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_21,negated_conjecture,
( X1 != sk5(X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_22,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_13,c_0_14]),c_0_15])]),c_0_16]),c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X1)
| memberP(sk3,sk5(X1)) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| ssItem(sk5(X1)) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
( X1 != sk5(X1)
| ~ ssItem(X1) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
( ~ ssItem(X1)
| sk3 = nil
| sk5(X1) = sk6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| sk6 != X1
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
sk3 = nil,
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssItem(X1)
| memberP(nil,sk5(X1)) ),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_30,axiom,
ssItem(skac3),
clause9 ).
cnf(c_0_31,negated_conjecture,
~ ssItem(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_29]),c_0_24]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC198-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.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 08:07:35 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.59/0.51 % Version: 3.5.1
% 0.59/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.59/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.59/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.59/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.59/0.51 % Starting sh5l with 300s (1) cores
% 0.59/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 997299 completed with status 0
% 0.59/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.59/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.59/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.59/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.59/0.51 % No SInE strategy applied
% 0.59/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.59/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.59/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.59/0.51 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.59/0.51 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.59/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.59/0.51 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 997307 completed with status 0
% 0.59/0.51 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.59/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.59/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.59/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.59/0.51 % No SInE strategy applied
% 0.59/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.59/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.59/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.59/0.51 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.59/0.51 % Preprocessing time : 0.004 s
% 0.59/0.51 % Presaturation interreduction done
% 0.59/0.51
% 0.59/0.51 % Proof found!
% 0.59/0.51 % SZS status Unsatisfiable
% 0.59/0.51 % SZS output start CNFRefutation
% See solution above
% 0.59/0.51 % Parsed axioms : 202
% 0.59/0.51 % Removed by relevancy pruning/SinE : 0
% 0.59/0.51 % Initial clauses : 202
% 0.59/0.51 % Removed in clause preprocessing : 0
% 0.59/0.51 % Initial clauses in saturation : 202
% 0.59/0.51 % Processed clauses : 739
% 0.59/0.51 % ...of these trivial : 34
% 0.59/0.51 % ...subsumed : 172
% 0.59/0.51 % ...remaining for further processing : 533
% 0.59/0.51 % Other redundant clauses eliminated : 82
% 0.59/0.51 % Clauses deleted for lack of memory : 0
% 0.59/0.51 % Backward-subsumed : 81
% 0.59/0.51 % Backward-rewritten : 89
% 0.59/0.51 % Generated clauses : 1676
% 0.59/0.51 % ...of the previous two non-redundant : 1504
% 0.59/0.51 % ...aggressively subsumed : 0
% 0.59/0.51 % Contextual simplify-reflections : 58
% 0.59/0.51 % Paramodulations : 1556
% 0.59/0.51 % Factorizations : 0
% 0.59/0.51 % NegExts : 0
% 0.59/0.51 % Equation resolutions : 99
% 0.59/0.51 % Disequality decompositions : 0
% 0.59/0.51 % Total rewrite steps : 1267
% 0.59/0.51 % ...of those cached : 1137
% 0.59/0.51 % Propositional unsat checks : 0
% 0.59/0.51 % Propositional check models : 0
% 0.59/0.51 % Propositional check unsatisfiable : 0
% 0.59/0.51 % Propositional clauses : 0
% 0.59/0.51 % Propositional clauses after purity: 0
% 0.59/0.51 % Propositional unsat core size : 0
% 0.59/0.51 % Propositional preprocessing time : 0.000
% 0.59/0.51 % Propositional encoding time : 0.000
% 0.59/0.51 % Propositional solver time : 0.000
% 0.59/0.51 % Success case prop preproc time : 0.000
% 0.59/0.51 % Success case prop encoding time : 0.000
% 0.59/0.51 % Success case prop solver time : 0.000
% 0.59/0.51 % Current number of processed clauses : 141
% 0.59/0.51 % Positive orientable unit clauses : 39
% 0.59/0.51 % Positive unorientable unit clauses: 0
% 0.59/0.51 % Negative unit clauses : 3
% 0.59/0.51 % Non-unit-clauses : 99
% 0.59/0.51 % Current number of unprocessed clauses: 1135
% 0.59/0.51 % ...number of literals in the above : 7666
% 0.59/0.51 % Current number of archived formulas : 0
% 0.59/0.51 % Current number of archived clauses : 386
% 0.59/0.51 % Clause-clause subsumption calls (NU) : 16570
% 0.59/0.51 % Rec. Clause-clause subsumption calls : 3656
% 0.59/0.51 % Non-unit clause-clause subsumptions : 226
% 0.59/0.51 % Unit Clause-clause subsumption calls : 252
% 0.59/0.51 % Rewrite failures with RHS unbound : 0
% 0.59/0.51 % BW rewrite match attempts : 2
% 0.59/0.51 % BW rewrite match successes : 2
% 0.59/0.51 % Condensation attempts : 0
% 0.59/0.51 % Condensation successes : 0
% 0.59/0.51 % Termbank termtop insertions : 38898
% 0.59/0.51 % Search garbage collected termcells : 542
% 0.59/0.51
% 0.59/0.51 % -------------------------------------------------
% 0.59/0.51 % User time : 0.071 s
% 0.59/0.51 % System time : 0.005 s
% 0.59/0.51 % Total time : 0.076 s
% 0.59/0.51 % Maximum resident set size: 4068 pages
% 0.59/0.51
% 0.59/0.51 % -------------------------------------------------
% 0.59/0.51 % User time : 0.315 s
% 0.59/0.51 % System time : 0.028 s
% 0.59/0.51 % Total time : 0.343 s
% 0.59/0.51 % Maximum resident set size: 5120 pages
% 0.59/0.51 % E exiting
%------------------------------------------------------------------------------