%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC129-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:08 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.55s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 17 unt; 3 nHn; 20 RR)
% Number of literals : 29 ( 6 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
~ cyclefreeP(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
~ neq(sk4,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause7,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause7) ).
cnf(c_0_7,negated_conjecture,
~ cyclefreeP(sk2),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_8,negated_conjecture,
~ neq(sk4,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_9,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_10,negated_conjecture,
~ cyclefreeP(sk2),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_12,negated_conjecture,
~ neq(sk4,nil),
c_0_8 ).
cnf(c_0_13,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_15,axiom,
ssList(nil),
clause8 ).
cnf(c_0_16,negated_conjecture,
~ cyclefreeP(sk4),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_18,axiom,
cyclefreeP(nil),
clause7 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC129-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n009.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 07:57:42 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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.26/0.55 % Version: 3.5.1
% 0.26/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % new_bool_3 with pid 1257397 completed with status 0
% 0.26/0.55 % Result found by new_bool_3
% 0.26/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.55 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.26/0.55 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.26/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.55 % SubtermCWHack with pid 1257400 completed with status 0
% 0.26/0.55 % Result found by SubtermCWHack
% 0.26/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.55 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.26/0.55 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.26/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.55 % Preprocessing time : 0.003 s
% 0.26/0.55
% 0.26/0.55 % Proof found!
% 0.26/0.55 % SZS status Unsatisfiable
% 0.26/0.55 % SZS output start CNFRefutation
% See solution above
% 0.26/0.55 % Parsed axioms : 193
% 0.26/0.55 % Removed by relevancy pruning/SinE : 150
% 0.26/0.55 % Initial clauses : 43
% 0.26/0.55 % Removed in clause preprocessing : 0
% 0.26/0.55 % Initial clauses in saturation : 43
% 0.26/0.55 % Processed clauses : 23
% 0.26/0.55 % ...of these trivial : 0
% 0.26/0.55 % ...subsumed : 0
% 0.26/0.55 % ...remaining for further processing : 23
% 0.26/0.55 % Other redundant clauses eliminated : 0
% 0.26/0.55 % Clauses deleted for lack of memory : 0
% 0.26/0.55 % Backward-subsumed : 0
% 0.26/0.55 % Backward-rewritten : 7
% 0.26/0.55 % Generated clauses : 4
% 0.26/0.55 % ...of the previous two non-redundant : 3
% 0.26/0.55 % ...aggressively subsumed : 0
% 0.26/0.55 % Contextual simplify-reflections : 0
% 0.26/0.55 % Paramodulations : 4
% 0.26/0.55 % Factorizations : 0
% 0.26/0.55 % NegExts : 0
% 0.26/0.55 % Equation resolutions : 0
% 0.26/0.55 % Disequality decompositions : 0
% 0.26/0.55 % Total rewrite steps : 11
% 0.26/0.55 % ...of those cached : 4
% 0.26/0.55 % Propositional unsat checks : 0
% 0.26/0.55 % Propositional check models : 0
% 0.26/0.55 % Propositional check unsatisfiable : 0
% 0.26/0.55 % Propositional clauses : 0
% 0.26/0.55 % Propositional clauses after purity: 0
% 0.26/0.55 % Propositional unsat core size : 0
% 0.26/0.55 % Propositional preprocessing time : 0.000
% 0.26/0.55 % Propositional encoding time : 0.000
% 0.26/0.55 % Propositional solver time : 0.000
% 0.26/0.55 % Success case prop preproc time : 0.000
% 0.26/0.55 % Success case prop encoding time : 0.000
% 0.26/0.55 % Success case prop solver time : 0.000
% 0.26/0.55 % Current number of processed clauses : 16
% 0.26/0.55 % Positive orientable unit clauses : 5
% 0.26/0.55 % Positive unorientable unit clauses: 0
% 0.26/0.55 % Negative unit clauses : 0
% 0.26/0.55 % Non-unit-clauses : 11
% 0.26/0.55 % Current number of unprocessed clauses: 23
% 0.26/0.55 % ...number of literals in the above : 112
% 0.26/0.55 % Current number of archived formulas : 0
% 0.26/0.55 % Current number of archived clauses : 7
% 0.26/0.55 % Clause-clause subsumption calls (NU) : 7
% 0.26/0.55 % Rec. Clause-clause subsumption calls : 6
% 0.26/0.55 % Non-unit clause-clause subsumptions : 0
% 0.26/0.55 % Unit Clause-clause subsumption calls : 0
% 0.26/0.55 % Rewrite failures with RHS unbound : 0
% 0.26/0.55 % BW rewrite match attempts : 3
% 0.26/0.55 % BW rewrite match successes : 3
% 0.26/0.55 % Condensation attempts : 0
% 0.26/0.55 % Condensation successes : 0
% 0.26/0.55 % Termbank termtop insertions : 3204
% 0.26/0.55 % Search garbage collected termcells : 899
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.003 s
% 0.26/0.55 % System time : 0.006 s
% 0.26/0.55 % Total time : 0.009 s
% 0.26/0.55 % Maximum resident set size: 4064 pages
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.007 s
% 0.26/0.55 % System time : 0.011 s
% 0.26/0.55 % Total time : 0.018 s
% 0.26/0.55 % Maximum resident set size: 4864 pages
% 0.26/0.55 % E exiting
%------------------------------------------------------------------------------