%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC378+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:09 PM UTC 2026
% Result : Theorem 0.12s 0.47s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 152 ( 29 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 192 ( 78 ~; 75 |; 20 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ! [X7] :
( ( memberP(X1,X7)
& memberP(X2,X7) )
| ( ~ memberP(X1,X7)
& ~ memberP(X2,X7) )
| ~ ssItem(X7) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X3
| app(X5,X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ! [X7] :
( ( memberP(X1,X7)
& memberP(X2,X7) )
| ( ~ memberP(X1,X7)
& ~ memberP(X2,X7) )
| ~ ssItem(X7) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X3
| app(X5,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] :
( ! [X7] :
( ( memberP(X1,X7)
& memberP(X2,X7) )
| ( ~ memberP(X1,X7)
& ~ memberP(X2,X7) )
| ~ ssItem(X7) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X3
| app(X5,X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
( ( ~ memberP(esk1_0,esk7_0)
| ~ memberP(esk2_0,esk7_0) )
& ( memberP(esk1_0,esk7_0)
| memberP(esk2_0,esk7_0) )
& ssItem(esk7_0)
& app(esk6_0,esk5_0) = esk3_0
& app(esk5_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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X44,X45,X46] :
( app(app(X44,X45),X46) = app(X44,app(X45,X46))
| ~ ssList(X46)
| ~ ssList(X45)
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_7,negated_conjecture,
app(esk6_0,esk5_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
app(esk6_0,esk5_0) = esk1_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_15,plain,
! [X21,X22,X23] :
( ( ~ ssItem(X21)
| ~ ssList(X22)
| ~ ssList(X23)
| memberP(app(X22,X23),X21)
| ~ memberP(X23,X21) )
& ( ~ ssItem(X21)
| ~ ssList(X22)
| ~ ssList(X23)
| memberP(app(X22,X23),X21)
| ~ memberP(X22,X21) )
& ( ~ ssItem(X21)
| ~ ssList(X22)
| ~ ssList(X23)
| memberP(X23,X21)
| memberP(X22,X21)
| ~ memberP(app(X22,X23),X21) ) ),
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])])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssList(X1)
| app(esk6_0,app(esk5_0,X1)) = app(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_17,negated_conjecture,
app(esk5_0,esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
app(esk6_0,esk2_0) = app(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12])]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(app(X1,X2),X3)
| memberP(X2,X3)
| memberP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk2_0,X1)
| memberP(app(esk1_0,esk6_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk6_0,X1)
| memberP(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X1)
| app(esk5_0,app(esk6_0,X1)) = app(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_12]),c_0_11])]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk2_0,X1)
| memberP(esk1_0,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_24])]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( memberP(esk1_0,esk7_0)
| memberP(esk2_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,negated_conjecture,
app(esk5_0,esk1_0) = app(esk2_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_10]),c_0_11])]) ).
cnf(c_0_31,negated_conjecture,
( ~ memberP(esk1_0,esk7_0)
| ~ memberP(esk2_0,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,negated_conjecture,
memberP(esk1_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk1_0,X1)
| memberP(app(esk2_0,esk5_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_11]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk5_0,X1)
| memberP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_12]),c_0_11])]) ).
cnf(c_0_35,negated_conjecture,
~ memberP(esk2_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk1_0,X1)
| memberP(esk2_0,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_33]),c_0_11]),c_0_20])]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC378+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 : n011.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:19:40 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.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.47 % Version: 3.5.1
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.47 % Starting sh5l with 300s (1) cores
% 0.12/0.47 % new_bool_3 with pid 1442754 completed with status 0
% 0.12/0.47 % Result found by new_bool_3
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.12/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47 % SubtermCWHack with pid 1442757 completed with status 0
% 0.12/0.47 % Result found by SubtermCWHack
% 0.12/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.12/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.47 % Preprocessing time : 0.002 s
% 0.12/0.47
% 0.12/0.47 % Proof found!
% 0.12/0.47 % SZS status Theorem
% 0.12/0.47 % SZS output start CNFRefutation
% See solution above
% 0.12/0.47 % Parsed axioms : 96
% 0.12/0.47 % Removed by relevancy pruning/SinE : 75
% 0.12/0.47 % Initial clauses : 47
% 0.12/0.47 % Removed in clause preprocessing : 0
% 0.12/0.47 % Initial clauses in saturation : 47
% 0.12/0.47 % Processed clauses : 411
% 0.12/0.47 % ...of these trivial : 19
% 0.12/0.47 % ...subsumed : 175
% 0.12/0.47 % ...remaining for further processing : 217
% 0.12/0.47 % Other redundant clauses eliminated : 16
% 0.12/0.47 % Clauses deleted for lack of memory : 0
% 0.12/0.47 % Backward-subsumed : 22
% 0.12/0.47 % Backward-rewritten : 4
% 0.12/0.47 % Generated clauses : 1012
% 0.12/0.47 % ...of the previous two non-redundant : 819
% 0.12/0.47 % ...aggressively subsumed : 0
% 0.12/0.47 % Contextual simplify-reflections : 9
% 0.12/0.47 % Paramodulations : 993
% 0.12/0.47 % Factorizations : 0
% 0.12/0.47 % NegExts : 0
% 0.12/0.47 % Equation resolutions : 20
% 0.12/0.47 % Disequality decompositions : 0
% 0.12/0.47 % Total rewrite steps : 1175
% 0.12/0.47 % ...of those cached : 1154
% 0.12/0.47 % Propositional unsat checks : 0
% 0.12/0.47 % Propositional check models : 0
% 0.12/0.47 % Propositional check unsatisfiable : 0
% 0.12/0.47 % Propositional clauses : 0
% 0.12/0.47 % Propositional clauses after purity: 0
% 0.12/0.47 % Propositional unsat core size : 0
% 0.12/0.47 % Propositional preprocessing time : 0.000
% 0.12/0.47 % Propositional encoding time : 0.000
% 0.12/0.47 % Propositional solver time : 0.000
% 0.12/0.47 % Success case prop preproc time : 0.000
% 0.12/0.47 % Success case prop encoding time : 0.000
% 0.12/0.47 % Success case prop solver time : 0.000
% 0.12/0.47 % Current number of processed clauses : 188
% 0.12/0.47 % Positive orientable unit clauses : 28
% 0.12/0.47 % Positive unorientable unit clauses: 0
% 0.12/0.47 % Negative unit clauses : 20
% 0.12/0.47 % Non-unit-clauses : 140
% 0.12/0.47 % Current number of unprocessed clauses: 438
% 0.12/0.47 % ...number of literals in the above : 1846
% 0.12/0.47 % Current number of archived formulas : 0
% 0.12/0.47 % Current number of archived clauses : 26
% 0.12/0.47 % Clause-clause subsumption calls (NU) : 4541
% 0.12/0.47 % Rec. Clause-clause subsumption calls : 2946
% 0.12/0.47 % Non-unit clause-clause subsumptions : 129
% 0.12/0.47 % Unit Clause-clause subsumption calls : 198
% 0.12/0.47 % Rewrite failures with RHS unbound : 0
% 0.12/0.47 % BW rewrite match attempts : 3
% 0.12/0.47 % BW rewrite match successes : 3
% 0.12/0.47 % Condensation attempts : 0
% 0.12/0.47 % Condensation successes : 0
% 0.12/0.47 % Termbank termtop insertions : 18489
% 0.12/0.47 % Search garbage collected termcells : 1462
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.025 s
% 0.12/0.47 % System time : 0.005 s
% 0.12/0.47 % Total time : 0.030 s
% 0.12/0.47 % Maximum resident set size: 3760 pages
% 0.12/0.47
% 0.12/0.47 % -------------------------------------------------
% 0.12/0.47 % User time : 0.027 s
% 0.12/0.47 % System time : 0.007 s
% 0.12/0.47 % Total time : 0.035 s
% 0.12/0.47 % Maximum resident set size: 4864 pages
% 0.12/0.47 % E exiting
%------------------------------------------------------------------------------