%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET076+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 : n020.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:16:24 PM UTC 2026
% Result : Theorem 0.14s 0.68s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 54 ( 11 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 54 ( 17 ~; 22 |; 10 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( ( X3 = X2
| X3 = X1 )
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
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(unordered_pair_is_subset,conjecture,
! [X1,X2,X5] :
( ( member(X2,X5)
& member(X1,X5) )
=> subclass(unordered_pair(X1,X2),X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_is_subset) ).
fof(c_0_3,plain,
! [X22,X23,X24] :
( ( member(X22,unordered_pair(X23,X24))
| ~ member(X22,universal_class)
| X22 != X24 )
& ( member(X22,unordered_pair(X23,X24))
| ~ member(X22,universal_class)
| X22 != X23 )
& ( ~ member(X22,unordered_pair(X23,X24))
| X22 = X24
| X22 = X23 )
& ( ~ member(X22,unordered_pair(X23,X24))
| member(X22,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])]) ).
fof(c_0_4,plain,
! [X13,X14,X15,X16,X17] :
( ( subclass(X16,X17)
| ~ member(esk4_2(X16,X17),X17) )
& ( subclass(X16,X17)
| member(esk4_2(X16,X17),X16) )
& ( member(X15,X14)
| ~ member(X15,X13)
| ~ subclass(X13,X14) ) ),
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_5,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( subclass(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X5] :
( ( member(X2,X5)
& member(X1,X5) )
=> subclass(unordered_pair(X1,X2),X5) ),
inference(assume_negation,[status(cth)],[unordered_pair_is_subset]) ).
cnf(c_0_8,plain,
( ~ member(esk4_2(X1,X2),X2)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( subclass(unordered_pair(X1,X2),X3)
| esk4_2(unordered_pair(X1,X2),X3) = X1
| esk4_2(unordered_pair(X1,X2),X3) = X2 ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
fof(c_0_10,negated_conjecture,
( ~ subclass(unordered_pair(esk1_0,esk2_0),esk3_0)
& member(esk2_0,esk3_0)
& member(esk1_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( ~ member(X1,X3)
| subclass(unordered_pair(X1,X2),X3)
| esk4_2(unordered_pair(X1,X2),X3) = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ subclass(unordered_pair(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( ~ member(X1,X3)
| ~ member(X2,X3)
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
member(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
member(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
$false,
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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET076+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.58 % Computer : n020.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Mon Sep 21 04:51:03 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.63 Running first-order theorem proving
% 0.14/0.63 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.14/0.68 % Version: 3.5.1
% 0.14/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.68 % Starting sh5l with 300s (1) cores
% 0.14/0.68 % new_bool_3 with pid 2040833 completed with status 0
% 0.14/0.68 % Result found by new_bool_3
% 0.14/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.68 % Search class: FGUSM-FFSF21-MFFFFFNN
% 0.14/0.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.68 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.68 % SubtermCWHack with pid 2040838 completed with status 0
% 0.14/0.68 % Result found by SubtermCWHack
% 0.14/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.68 % Search class: FGUSM-FFSF21-MFFFFFNN
% 0.14/0.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.68 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.68 % Preprocessing time : 0.002 s
% 0.14/0.68
% 0.14/0.68 % Proof found!
% 0.14/0.68 % SZS status Theorem
% 0.14/0.68 % SZS output start CNFRefutation
% See solution above
% 0.14/0.68 % Parsed axioms : 44
% 0.14/0.68 % Removed by relevancy pruning/SinE : 35
% 0.14/0.68 % Initial clauses : 20
% 0.14/0.68 % Removed in clause preprocessing : 0
% 0.14/0.68 % Initial clauses in saturation : 20
% 0.14/0.68 % Processed clauses : 309
% 0.14/0.68 % ...of these trivial : 37
% 0.14/0.68 % ...subsumed : 136
% 0.14/0.68 % ...remaining for further processing : 136
% 0.14/0.68 % Other redundant clauses eliminated : 6
% 0.14/0.68 % Clauses deleted for lack of memory : 0
% 0.14/0.68 % Backward-subsumed : 2
% 0.14/0.68 % Backward-rewritten : 5
% 0.14/0.68 % Generated clauses : 2912
% 0.14/0.68 % ...of the previous two non-redundant : 1619
% 0.14/0.68 % ...aggressively subsumed : 0
% 0.14/0.68 % Contextual simplify-reflections : 0
% 0.14/0.68 % Paramodulations : 2902
% 0.14/0.68 % Factorizations : 4
% 0.14/0.68 % NegExts : 0
% 0.14/0.68 % Equation resolutions : 6
% 0.14/0.68 % Disequality decompositions : 0
% 0.14/0.68 % Total rewrite steps : 1554
% 0.14/0.68 % ...of those cached : 1424
% 0.14/0.68 % Propositional unsat checks : 0
% 0.14/0.68 % Propositional check models : 0
% 0.14/0.68 % Propositional check unsatisfiable : 0
% 0.14/0.68 % Propositional clauses : 0
% 0.14/0.68 % Propositional clauses after purity: 0
% 0.14/0.68 % Propositional unsat core size : 0
% 0.14/0.68 % Propositional preprocessing time : 0.000
% 0.14/0.68 % Propositional encoding time : 0.000
% 0.14/0.68 % Propositional solver time : 0.000
% 0.14/0.68 % Success case prop preproc time : 0.000
% 0.14/0.68 % Success case prop encoding time : 0.000
% 0.14/0.68 % Success case prop solver time : 0.000
% 0.14/0.68 % Current number of processed clauses : 125
% 0.14/0.68 % Positive orientable unit clauses : 50
% 0.14/0.68 % Positive unorientable unit clauses: 3
% 0.14/0.68 % Negative unit clauses : 1
% 0.14/0.68 % Non-unit-clauses : 71
% 0.14/0.68 % Current number of unprocessed clauses: 1313
% 0.14/0.68 % ...number of literals in the above : 4162
% 0.14/0.68 % Current number of archived formulas : 0
% 0.14/0.68 % Current number of archived clauses : 7
% 0.14/0.68 % Clause-clause subsumption calls (NU) : 589
% 0.14/0.68 % Rec. Clause-clause subsumption calls : 534
% 0.14/0.68 % Non-unit clause-clause subsumptions : 99
% 0.14/0.68 % Unit Clause-clause subsumption calls : 5
% 0.14/0.68 % Rewrite failures with RHS unbound : 0
% 0.14/0.68 % BW rewrite match attempts : 14
% 0.14/0.68 % BW rewrite match successes : 7
% 0.14/0.68 % Condensation attempts : 0
% 0.14/0.68 % Condensation successes : 0
% 0.14/0.68 % Termbank termtop insertions : 31920
% 0.14/0.68 % Search garbage collected termcells : 508
% 0.14/0.68
% 0.14/0.68 % -------------------------------------------------
% 0.14/0.68 % User time : 0.031 s
% 0.14/0.68 % System time : 0.006 s
% 0.14/0.68 % Total time : 0.037 s
% 0.14/0.68 % Maximum resident set size: 3692 pages
% 0.14/0.68
% 0.14/0.68 % -------------------------------------------------
% 0.14/0.68 % User time : 0.035 s
% 0.14/0.68 % System time : 0.009 s
% 0.14/0.68 % Total time : 0.044 s
% 0.14/0.68 % Maximum resident set size: 4608 pages
% 0.14/0.68 % E exiting
%------------------------------------------------------------------------------