%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET056+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:13:19 PM UTC 2026
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 59 ( 10 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 66 ( 26 ~; 24 |; 13 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(equality1,conjecture,
! [X1,X2] :
( ? [X7] :
( ~ member(X7,X1)
& member(X7,X2) )
| ? [X3] :
( ~ member(X3,X2)
& member(X3,X1) )
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equality1) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X2,X1)
& subclass(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ? [X7] :
( ~ member(X7,X1)
& member(X7,X2) )
| ? [X3] :
( ~ member(X3,X2)
& member(X3,X1) )
| X1 = X2 ),
inference(assume_negation,[status(cth)],[equality1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ? [X7] :
( ~ member(X7,X1)
& member(X7,X2) )
| ? [X3] :
( ~ member(X3,X2)
& member(X3,X1) )
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
! [X12,X13] :
( ( member(X13,esk1_0)
| ~ member(X13,esk2_0) )
& ( member(X12,esk2_0)
| ~ member(X12,esk1_0) )
& esk1_0 != esk2_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])])])])]) ).
fof(c_0_6,plain,
! [X14,X15,X16,X17,X18] :
( ( subclass(X17,X18)
| ~ member(esk3_2(X17,X18),X18) )
& ( subclass(X17,X18)
| member(esk3_2(X17,X18),X17) )
& ( member(X16,X15)
| ~ member(X16,X14)
| ~ subclass(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subclass_defn])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ member(X1,esk2_0)
| member(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( subclass(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X25,X26] :
( ( X25 = X26
| ~ subclass(X26,X25)
| ~ subclass(X25,X26) )
& ( X25 != X26
| subclass(X26,X25) )
& ( X25 != X26
| subclass(X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])]) ).
cnf(c_0_10,plain,
( ~ member(esk3_2(X1,X2),X2)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( subclass(esk2_0,X1)
| member(esk3_2(esk2_0,X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
subclass(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(esk3_2(X1,esk2_0),esk1_0)
| subclass(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ subclass(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_8]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET056+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:48:11 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % sh5l with pid 998896 completed with status 0
% 0.15/0.43 % Result found by sh5l
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.15/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 998905 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.15/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.43 % Preprocessing time : 0.002 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Theorem
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 44
% 0.15/0.43 % Removed by relevancy pruning/SinE : 5
% 0.15/0.43 % Initial clauses : 79
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 79
% 0.15/0.43 % Processed clauses : 62
% 0.15/0.43 % ...of these trivial : 0
% 0.15/0.43 % ...subsumed : 0
% 0.15/0.43 % ...remaining for further processing : 62
% 0.15/0.43 % Other redundant clauses eliminated : 2
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 0
% 0.15/0.43 % Backward-rewritten : 1
% 0.15/0.43 % Generated clauses : 51
% 0.15/0.43 % ...of the previous two non-redundant : 46
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 0
% 0.15/0.43 % Paramodulations : 49
% 0.15/0.43 % Factorizations : 0
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 2
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 3
% 0.15/0.43 % ...of those cached : 1
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 59
% 0.15/0.43 % Positive orientable unit clauses : 20
% 0.15/0.43 % Positive unorientable unit clauses: 0
% 0.15/0.43 % Negative unit clauses : 3
% 0.15/0.43 % Non-unit-clauses : 36
% 0.15/0.43 % Current number of unprocessed clauses: 63
% 0.15/0.43 % ...number of literals in the above : 151
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 1
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 113
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 100
% 0.15/0.43 % Non-unit clause-clause subsumptions : 0
% 0.15/0.43 % Unit Clause-clause subsumption calls : 15
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 6
% 0.15/0.43 % BW rewrite match successes : 1
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 5235
% 0.15/0.43 % Search garbage collected termcells : 878
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.009 s
% 0.15/0.43 % System time : 0.004 s
% 0.15/0.43 % Total time : 0.013 s
% 0.15/0.43 % Maximum resident set size: 3948 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.011 s
% 0.15/0.43 % System time : 0.010 s
% 0.15/0.43 % Total time : 0.020 s
% 0.15/0.43 % Maximum resident set size: 4864 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------