%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET072+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 : n014.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:25 PM UTC 2026
% Result : Theorem 0.03s 0.42s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 45 ( 20 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 42 ( 14 ~; 14 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn 12 !; 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(right_cancellation,conjecture,
! [X1,X2,X5] :
( ( unordered_pair(X1,X5) = unordered_pair(X2,X5)
& member(X2,universal_class)
& member(X1,universal_class) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation) ).
fof(c_0_2,plain,
! [X13,X14,X15] :
( ( member(X13,unordered_pair(X14,X15))
| ~ member(X13,universal_class)
| X13 != X15 )
& ( member(X13,unordered_pair(X14,X15))
| ~ member(X13,universal_class)
| X13 != X14 )
& ( ~ member(X13,unordered_pair(X14,X15))
| X13 = X15
| X13 = X14 )
& ( ~ member(X13,unordered_pair(X14,X15))
| member(X13,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_3,negated_conjecture,
~ ! [X1,X2,X5] :
( ( unordered_pair(X1,X5) = unordered_pair(X2,X5)
& member(X2,universal_class)
& member(X1,universal_class) )
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[right_cancellation]) ).
cnf(c_0_4,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( esk1_0 != esk2_0
& unordered_pair(esk1_0,esk3_0) = unordered_pair(esk2_0,esk3_0)
& member(esk2_0,universal_class)
& member(esk1_0,universal_class) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
unordered_pair(esk1_0,esk3_0) = unordered_pair(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
member(esk2_0,unordered_pair(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk3_0 = esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
unordered_pair(esk2_0,esk2_0) = unordered_pair(esk1_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_12]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(X1,unordered_pair(esk1_0,esk2_0))
| X1 = esk2_0 ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
member(esk1_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_15])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET072+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 : n014.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.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Mon Sep 21 04:50:19 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/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.03/0.42 % Version: 3.5.1
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % Starting sh5l with 300s (1) cores
% 0.03/0.42 % new_bool_1 with pid 3173558 completed with status 0
% 0.03/0.42 % Result found by new_bool_1
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.42 % Search class: FGUSS-FFSS21-MFFFFFNN
% 0.03/0.42 % partial match(1): FGUSS-FFSS21-SFFFFFNN
% 0.03/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.42 % SubtermCWHack with pid 3173561 completed with status 0
% 0.03/0.42 % Result found by SubtermCWHack
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.42 % Search class: FGUSS-FFSS21-MFFFFFNN
% 0.03/0.42 % partial match(1): FGUSS-FFSS21-SFFFFFNN
% 0.03/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.42 % Preprocessing time : 0.001 s
% 0.03/0.42
% 0.03/0.42 % Proof found!
% 0.03/0.42 % SZS status Theorem
% 0.03/0.42 % SZS output start CNFRefutation
% See solution above
% 0.03/0.42 % Parsed axioms : 44
% 0.03/0.42 % Removed by relevancy pruning/SinE : 38
% 0.03/0.42 % Initial clauses : 14
% 0.03/0.42 % Removed in clause preprocessing : 0
% 0.03/0.42 % Initial clauses in saturation : 14
% 0.03/0.42 % Processed clauses : 30
% 0.03/0.42 % ...of these trivial : 0
% 0.03/0.42 % ...subsumed : 6
% 0.03/0.42 % ...remaining for further processing : 24
% 0.03/0.42 % Other redundant clauses eliminated : 2
% 0.03/0.42 % Clauses deleted for lack of memory : 0
% 0.03/0.42 % Backward-subsumed : 0
% 0.03/0.42 % Backward-rewritten : 1
% 0.03/0.42 % Generated clauses : 31
% 0.03/0.42 % ...of the previous two non-redundant : 21
% 0.03/0.42 % ...aggressively subsumed : 0
% 0.03/0.42 % Contextual simplify-reflections : 0
% 0.03/0.42 % Paramodulations : 29
% 0.03/0.42 % Factorizations : 0
% 0.03/0.42 % NegExts : 0
% 0.03/0.42 % Equation resolutions : 2
% 0.03/0.42 % Disequality decompositions : 0
% 0.03/0.42 % Total rewrite steps : 13
% 0.03/0.42 % ...of those cached : 6
% 0.03/0.42 % Propositional unsat checks : 0
% 0.03/0.42 % Propositional check models : 0
% 0.03/0.42 % Propositional check unsatisfiable : 0
% 0.03/0.42 % Propositional clauses : 0
% 0.03/0.42 % Propositional clauses after purity: 0
% 0.03/0.42 % Propositional unsat core size : 0
% 0.03/0.42 % Propositional preprocessing time : 0.000
% 0.03/0.42 % Propositional encoding time : 0.000
% 0.03/0.42 % Propositional solver time : 0.000
% 0.03/0.42 % Success case prop preproc time : 0.000
% 0.03/0.42 % Success case prop encoding time : 0.000
% 0.03/0.42 % Success case prop solver time : 0.000
% 0.03/0.42 % Current number of processed clauses : 21
% 0.03/0.42 % Positive orientable unit clauses : 8
% 0.03/0.42 % Positive unorientable unit clauses: 1
% 0.03/0.42 % Negative unit clauses : 1
% 0.03/0.42 % Non-unit-clauses : 11
% 0.03/0.42 % Current number of unprocessed clauses: 5
% 0.03/0.42 % ...number of literals in the above : 11
% 0.03/0.42 % Current number of archived formulas : 0
% 0.03/0.42 % Current number of archived clauses : 1
% 0.03/0.42 % Clause-clause subsumption calls (NU) : 28
% 0.03/0.42 % Rec. Clause-clause subsumption calls : 28
% 0.03/0.42 % Non-unit clause-clause subsumptions : 6
% 0.03/0.42 % Unit Clause-clause subsumption calls : 0
% 0.03/0.42 % Rewrite failures with RHS unbound : 0
% 0.03/0.42 % BW rewrite match attempts : 2
% 0.03/0.42 % BW rewrite match successes : 1
% 0.03/0.42 % Condensation attempts : 0
% 0.03/0.42 % Condensation successes : 0
% 0.03/0.42 % Termbank termtop insertions : 1398
% 0.03/0.42 % Search garbage collected termcells : 424
% 0.03/0.42
% 0.03/0.42 % -------------------------------------------------
% 0.03/0.42 % User time : 0.004 s
% 0.03/0.42 % System time : 0.001 s
% 0.03/0.42 % Total time : 0.005 s
% 0.03/0.42 % Maximum resident set size: 3692 pages
% 0.03/0.42
% 0.03/0.42 % -------------------------------------------------
% 0.03/0.42 % User time : 0.006 s
% 0.03/0.42 % System time : 0.006 s
% 0.03/0.42 % Total time : 0.012 s
% 0.03/0.42 % Maximum resident set size: 4608 pages
% 0.03/0.42 % E exiting
%------------------------------------------------------------------------------