%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC399+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 : n011.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:44:15 PM UTC 2026
% Result : Theorem 0.36s 15.53s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 162 ( 39 equ)
% Maximal formula atoms : 25 ( 6 avg)
% Number of connectives : 210 ( 74 ~; 74 |; 44 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 37 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X13] :
( memberP(X2,X13)
| ~ memberP(X1,X13)
| ~ ssItem(X13) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( app(X12,cons(X10,nil)) = X3
& ssList(X12) )
& app(cons(X10,nil),X11) = X6
& ssList(X11) )
& ssItem(X10) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(cons(X7,nil),X9) = X3
& ssList(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ equalelemsP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X3,X1)
| memberP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X13] :
( memberP(X2,X13)
| ~ memberP(X1,X13)
| ~ ssItem(X13) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( app(X12,cons(X10,nil)) = X3
& ssList(X12) )
& app(cons(X10,nil),X11) = X6
& ssList(X11) )
& ssItem(X10) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(cons(X7,nil),X9) = X3
& ssList(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ equalelemsP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X13] :
( memberP(X2,X13)
| ~ memberP(X1,X13)
| ~ ssItem(X13) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( app(X12,cons(X10,nil)) = X3
& ssList(X12) )
& app(cons(X10,nil),X11) = X6
& ssList(X11) )
& ssItem(X10) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(cons(X7,nil),X9) = X3
& ssList(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ equalelemsP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X38,X39,X40] :
( ( ~ ssItem(X38)
| ~ ssList(X39)
| ~ ssList(X40)
| memberP(app(X39,X40),X38)
| ~ memberP(X40,X38) )
& ( ~ ssItem(X38)
| ~ ssList(X39)
| ~ ssList(X40)
| memberP(app(X39,X40),X38)
| ~ memberP(X39,X38) )
& ( ~ ssItem(X38)
| ~ ssList(X39)
| ~ ssList(X40)
| memberP(X40,X38)
| memberP(X39,X38)
| ~ memberP(app(X39,X40),X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X20,X21,X22,X23,X24,X25] :
( ( nil != esk3_0
| nil = esk4_0 )
& ~ memberP(esk2_0,esk7_0)
& memberP(esk1_0,esk7_0)
& ssItem(esk7_0)
& ( app(X25,cons(X23,nil)) != esk3_0
| ~ ssList(X25)
| app(cons(X23,nil),X24) != esk6_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& ( app(cons(X20,nil),X22) != esk3_0
| ~ ssList(X22)
| app(X21,cons(X20,nil)) != esk5_0
| ~ ssList(X21)
| ~ ssItem(X20) )
& equalelemsP(esk3_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_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_4])])])])]) ).
cnf(c_0_7,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ memberP(esk2_0,esk7_0),
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,
( ~ ssItem(X1)
| ~ ssList(app(esk5_0,esk3_0))
| ~ memberP(app(esk5_0,esk3_0),X1)
| memberP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_13,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
memberP(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
~ memberP(esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(app(esk5_0,esk3_0))
| ~ memberP(esk3_0,X1)
| memberP(esk4_0,X1) ),
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_20,negated_conjecture,
memberP(esk3_0,esk7_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_22,plain,
! [X47,X48] :
( ssList(app(X47,X48))
| ~ ssList(X48)
| ~ ssList(X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_23,negated_conjecture,
~ ssList(app(esk5_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC399+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.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.11/15.45 % CPULimit : 300
% 0.11/15.45 % WCLimit : 300
% 0.11/15.45 % DateTime : Mon Sep 21 08:22:27 UTC 2026
% 0.11/15.45 % CPUTime :
% 0.11/15.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.36/15.50 Running first-order theorem proving
% 0.36/15.50 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.36/15.53 % Version: 3.5.1
% 0.36/15.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/15.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/15.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/15.53 % Starting new_bool_3 with 300s (1) cores
% 0.36/15.53 % Starting new_bool_1 with 300s (1) cores
% 0.36/15.53 % Starting sh5l with 300s (1) cores
% 0.36/15.53 % new_bool_1 with pid 461744 completed with status 0
% 0.36/15.53 % Result found by new_bool_1
% 0.36/15.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/15.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/15.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/15.53 % Starting new_bool_3 with 300s (1) cores
% 0.36/15.53 % Starting new_bool_1 with 300s (1) cores
% 0.36/15.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/15.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/15.53 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.36/15.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/15.53 % Starting SubtermCWHack with 31s (1) cores
% 0.36/15.53 % SubtermCWHack with pid 461747 completed with status 0
% 0.36/15.53 % Result found by SubtermCWHack
% 0.36/15.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/15.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/15.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/15.53 % Starting new_bool_3 with 300s (1) cores
% 0.36/15.53 % Starting new_bool_1 with 300s (1) cores
% 0.36/15.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/15.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/15.53 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.36/15.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/15.53 % Starting SubtermCWHack with 31s (1) cores
% 0.36/15.53 % Preprocessing time : 0.001 s
% 0.36/15.53
% 0.36/15.53 % Proof found!
% 0.36/15.53 % SZS status Theorem
% 0.36/15.53 % SZS output start CNFRefutation
% See solution above
% 0.36/15.53 % Parsed axioms : 96
% 0.36/15.53 % Removed by relevancy pruning/SinE : 72
% 0.36/15.53 % Initial clauses : 59
% 0.36/15.53 % Removed in clause preprocessing : 0
% 0.36/15.53 % Initial clauses in saturation : 59
% 0.36/15.53 % Processed clauses : 157
% 0.36/15.53 % ...of these trivial : 0
% 0.36/15.53 % ...subsumed : 54
% 0.36/15.53 % ...remaining for further processing : 103
% 0.36/15.53 % Other redundant clauses eliminated : 11
% 0.36/15.53 % Clauses deleted for lack of memory : 0
% 0.36/15.53 % Backward-subsumed : 42
% 0.36/15.53 % Backward-rewritten : 2
% 0.36/15.53 % Generated clauses : 406
% 0.36/15.53 % ...of the previous two non-redundant : 291
% 0.36/15.53 % ...aggressively subsumed : 0
% 0.36/15.53 % Contextual simplify-reflections : 2
% 0.36/15.53 % Paramodulations : 392
% 0.36/15.53 % Factorizations : 0
% 0.36/15.53 % NegExts : 0
% 0.36/15.53 % Equation resolutions : 15
% 0.36/15.53 % Disequality decompositions : 0
% 0.36/15.53 % Total rewrite steps : 457
% 0.36/15.53 % ...of those cached : 447
% 0.36/15.53 % Propositional unsat checks : 0
% 0.36/15.53 % Propositional check models : 0
% 0.36/15.53 % Propositional check unsatisfiable : 0
% 0.36/15.53 % Propositional clauses : 0
% 0.36/15.53 % Propositional clauses after purity: 0
% 0.36/15.53 % Propositional unsat core size : 0
% 0.36/15.53 % Propositional preprocessing time : 0.000
% 0.36/15.53 % Propositional encoding time : 0.000
% 0.36/15.53 % Propositional solver time : 0.000
% 0.36/15.53 % Success case prop preproc time : 0.000
% 0.36/15.53 % Success case prop encoding time : 0.000
% 0.36/15.53 % Success case prop solver time : 0.000
% 0.36/15.53 % Current number of processed clauses : 57
% 0.36/15.53 % Positive orientable unit clauses : 15
% 0.36/15.53 % Positive unorientable unit clauses: 0
% 0.36/15.53 % Negative unit clauses : 6
% 0.36/15.53 % Non-unit-clauses : 36
% 0.36/15.53 % Current number of unprocessed clauses: 88
% 0.36/15.53 % ...number of literals in the above : 458
% 0.36/15.53 % Current number of archived formulas : 0
% 0.36/15.53 % Current number of archived clauses : 44
% 0.36/15.53 % Clause-clause subsumption calls (NU) : 644
% 0.36/15.53 % Rec. Clause-clause subsumption calls : 579
% 0.36/15.53 % Non-unit clause-clause subsumptions : 61
% 0.36/15.53 % Unit Clause-clause subsumption calls : 103
% 0.36/15.53 % Rewrite failures with RHS unbound : 0
% 0.36/15.53 % BW rewrite match attempts : 2
% 0.36/15.53 % BW rewrite match successes : 2
% 0.36/15.53 % Condensation attempts : 0
% 0.36/15.53 % Condensation successes : 0
% 0.36/15.53 % Termbank termtop insertions : 10582
% 0.36/15.53 % Search garbage collected termcells : 1786
% 0.36/15.53
% 0.36/15.53 % -------------------------------------------------
% 0.36/15.53 % User time : 0.009 s
% 0.36/15.53 % System time : 0.004 s
% 0.36/15.53 % Total time : 0.013 s
% 0.36/15.53 % Maximum resident set size: 3764 pages
% 0.36/15.53
% 0.36/15.53 % -------------------------------------------------
% 0.36/15.53 % User time : 0.015 s
% 0.36/15.53 % System time : 0.007 s
% 0.36/15.53 % Total time : 0.022 s
% 0.36/15.53 % Maximum resident set size: 4864 pages
% 0.36/15.53 % E exiting
%------------------------------------------------------------------------------