%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC179-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 : n018.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:21 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.56s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 14 unt; 5 nHn; 17 RR)
% Number of literals : 33 ( 7 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
~ duplicatefreeP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause65,axiom,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause65) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
cnf(co1_18,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(clause2,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause2) ).
cnf(c_0_7,negated_conjecture,
~ duplicatefreeP(sk1),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_8,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_9,negated_conjecture,
~ duplicatefreeP(sk1),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_11,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause65]) ).
cnf(c_0_12,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_14,negated_conjecture,
~ duplicatefreeP(sk3),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
duplicatefreeP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_18,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_18 ).
cnf(c_0_19,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_20,axiom,
duplicatefreeP(nil),
clause2 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC179-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n018.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 08:04:13 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 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.25/0.56 % Version: 3.5.1
% 0.25/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.56 % Starting sh5l with 300s (1) cores
% 0.25/0.56 % new_bool_3 with pid 1404100 completed with status 0
% 0.25/0.56 % Result found by new_bool_3
% 0.25/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.56 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.25/0.56 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.25/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.56 % SubtermCWHack with pid 1404108 completed with status 0
% 0.25/0.56 % Result found by SubtermCWHack
% 0.25/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.56 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.25/0.56 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.25/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.56 % Preprocessing time : 0.002 s
% 0.25/0.56
% 0.25/0.56 % Proof found!
% 0.25/0.56 % SZS status Unsatisfiable
% 0.25/0.56 % SZS output start CNFRefutation
% See solution above
% 0.25/0.56 % Parsed axioms : 206
% 0.25/0.56 % Removed by relevancy pruning/SinE : 145
% 0.25/0.56 % Initial clauses : 61
% 0.25/0.56 % Removed in clause preprocessing : 0
% 0.25/0.56 % Initial clauses in saturation : 61
% 0.25/0.56 % Processed clauses : 27
% 0.25/0.56 % ...of these trivial : 0
% 0.25/0.56 % ...subsumed : 0
% 0.25/0.56 % ...remaining for further processing : 27
% 0.25/0.56 % Other redundant clauses eliminated : 0
% 0.25/0.56 % Clauses deleted for lack of memory : 0
% 0.25/0.56 % Backward-subsumed : 0
% 0.25/0.56 % Backward-rewritten : 15
% 0.25/0.56 % Generated clauses : 8
% 0.25/0.56 % ...of the previous two non-redundant : 11
% 0.25/0.56 % ...aggressively subsumed : 0
% 0.25/0.56 % Contextual simplify-reflections : 0
% 0.25/0.56 % Paramodulations : 8
% 0.25/0.56 % Factorizations : 0
% 0.25/0.56 % NegExts : 0
% 0.25/0.56 % Equation resolutions : 0
% 0.25/0.56 % Disequality decompositions : 0
% 0.25/0.56 % Total rewrite steps : 15
% 0.25/0.56 % ...of those cached : 7
% 0.25/0.56 % Propositional unsat checks : 0
% 0.25/0.56 % Propositional check models : 0
% 0.25/0.56 % Propositional check unsatisfiable : 0
% 0.25/0.56 % Propositional clauses : 0
% 0.25/0.56 % Propositional clauses after purity: 0
% 0.25/0.56 % Propositional unsat core size : 0
% 0.25/0.56 % Propositional preprocessing time : 0.000
% 0.25/0.56 % Propositional encoding time : 0.000
% 0.25/0.56 % Propositional solver time : 0.000
% 0.25/0.56 % Success case prop preproc time : 0.000
% 0.25/0.56 % Success case prop encoding time : 0.000
% 0.25/0.56 % Success case prop solver time : 0.000
% 0.25/0.56 % Current number of processed clauses : 12
% 0.25/0.56 % Positive orientable unit clauses : 8
% 0.25/0.56 % Positive unorientable unit clauses: 0
% 0.25/0.56 % Negative unit clauses : 2
% 0.25/0.56 % Non-unit-clauses : 2
% 0.25/0.56 % Current number of unprocessed clauses: 44
% 0.25/0.56 % ...number of literals in the above : 186
% 0.25/0.56 % Current number of archived formulas : 0
% 0.25/0.56 % Current number of archived clauses : 15
% 0.25/0.56 % Clause-clause subsumption calls (NU) : 2
% 0.25/0.56 % Rec. Clause-clause subsumption calls : 2
% 0.25/0.56 % Non-unit clause-clause subsumptions : 0
% 0.25/0.56 % Unit Clause-clause subsumption calls : 4
% 0.25/0.56 % Rewrite failures with RHS unbound : 0
% 0.25/0.56 % BW rewrite match attempts : 5
% 0.25/0.56 % BW rewrite match successes : 5
% 0.25/0.56 % Condensation attempts : 0
% 0.25/0.56 % Condensation successes : 0
% 0.25/0.56 % Termbank termtop insertions : 3756
% 0.25/0.56 % Search garbage collected termcells : 896
% 0.25/0.56
% 0.25/0.56 % -------------------------------------------------
% 0.25/0.56 % User time : 0.003 s
% 0.25/0.56 % System time : 0.004 s
% 0.25/0.56 % Total time : 0.007 s
% 0.25/0.56 % Maximum resident set size: 4072 pages
% 0.25/0.56
% 0.25/0.56 % -------------------------------------------------
% 0.25/0.56 % User time : 0.006 s
% 0.25/0.56 % System time : 0.009 s
% 0.25/0.56 % Total time : 0.015 s
% 0.25/0.56 % Maximum resident set size: 5120 pages
% 0.25/0.56 % E exiting
%------------------------------------------------------------------------------