%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC094+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 : n012.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:58 PM UTC 2026
% Result : Theorem 0.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 98 ( 46 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 120 ( 44 ~; 38 |; 22 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 21 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X2
& app(app(X5,X6),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| X4 != X3
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X2
& app(app(X5,X6),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| X4 != X3
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X2
& app(app(X5,X6),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| X4 != X3
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X12,X13,X14] :
( ( app(X12,X14) != esk2_0
| app(app(X12,X13),X14) != esk1_0
| ~ ssList(X14)
| ~ ssList(X13)
| ~ ssList(X12) )
& esk4_0 = esk3_0
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_7,negated_conjecture,
esk4_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X32,X33] :
( ( ~ ssList(X32)
| ~ ssList(X33)
| nil = app(X32,X33)
| nil != X32
| nil != X33 )
& ( ~ ssList(X32)
| ~ ssList(X33)
| nil != app(X32,X33)
| nil = X32 )
& ( ~ ssList(X32)
| ~ ssList(X33)
| nil != app(X32,X33)
| nil = X33 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_10,negated_conjecture,
( app(X1,X3) != esk2_0
| app(app(X1,X2),X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk4_0 = esk1_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X1,X3) != esk1_0
| app(app(X1,X2),X3) != esk1_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])]),c_0_14])]) ).
fof(c_0_17,plain,
! [X20] :
( app(nil,X20) = X20
| ~ ssList(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X1)
| app(nil,X1) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC094+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Mon Sep 21 07:55:06 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32 Running first-order theorem proving
% 0.07/0.32 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % new_bool_3 with pid 1932270 completed with status 0
% 0.07/0.34 % Result found by new_bool_3
% 0.07/0.34 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1932273 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Theorem
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.34 % Parsed axioms : 96
% 0.07/0.34 % Removed by relevancy pruning/SinE : 79
% 0.07/0.34 % Initial clauses : 31
% 0.07/0.34 % Removed in clause preprocessing : 0
% 0.07/0.34 % Initial clauses in saturation : 31
% 0.07/0.34 % Processed clauses : 67
% 0.07/0.34 % ...of these trivial : 0
% 0.07/0.34 % ...subsumed : 21
% 0.07/0.34 % ...remaining for further processing : 46
% 0.07/0.34 % Other redundant clauses eliminated : 11
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 0
% 0.07/0.34 % Backward-rewritten : 4
% 0.07/0.34 % Generated clauses : 178
% 0.07/0.34 % ...of the previous two non-redundant : 132
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 3
% 0.07/0.34 % Paramodulations : 164
% 0.07/0.34 % Factorizations : 0
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 15
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 106
% 0.07/0.34 % ...of those cached : 99
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 41
% 0.07/0.34 % Positive orientable unit clauses : 8
% 0.07/0.34 % Positive unorientable unit clauses: 0
% 0.07/0.34 % Negative unit clauses : 1
% 0.07/0.34 % Non-unit-clauses : 32
% 0.07/0.34 % Current number of unprocessed clauses: 91
% 0.07/0.34 % ...number of literals in the above : 500
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 4
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 177
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 109
% 0.07/0.34 % Non-unit clause-clause subsumptions : 24
% 0.07/0.34 % Unit Clause-clause subsumption calls : 0
% 0.07/0.34 % Rewrite failures with RHS unbound : 0
% 0.07/0.34 % BW rewrite match attempts : 3
% 0.07/0.34 % BW rewrite match successes : 3
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 6280
% 0.07/0.34 % Search garbage collected termcells : 1243
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.006 s
% 0.07/0.34 % System time : 0.001 s
% 0.07/0.34 % Total time : 0.007 s
% 0.07/0.34 % Maximum resident set size: 3756 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.007 s
% 0.07/0.34 % System time : 0.003 s
% 0.07/0.34 % Total time : 0.011 s
% 0.07/0.34 % Maximum resident set size: 4608 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------