%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET016+1 : TPTP v9.3.1. Bugfixed v5.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:13:05 PM UTC 2026
% Result : Theorem 0.24s 0.50s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 60 ( 31 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 47 ( 17 ~; 19 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 6 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ordered_pair_determines_components1,conjecture,
! [X7,X1,X2,X5] :
( ( member(X7,universal_class)
& ordered_pair(X7,X1) = ordered_pair(X2,X5) )
=> X7 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair_determines_components1) ).
fof(ordered_pair_defn,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
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/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(c_0_5,negated_conjecture,
~ ! [X7,X1,X2,X5] :
( ( member(X7,universal_class)
& ordered_pair(X7,X1) = ordered_pair(X2,X5) )
=> X7 = X2 ),
inference(assume_negation,[status(cth)],[ordered_pair_determines_components1]) ).
fof(c_0_6,plain,
! [X25,X26] : ordered_pair(X25,X26) = unordered_pair(singleton(X25),unordered_pair(X25,singleton(X26))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
fof(c_0_7,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_8,plain,
! [X19,X20,X21] :
( ( member(X19,unordered_pair(X20,X21))
| ~ member(X19,universal_class)
| X19 != X21 )
& ( member(X19,unordered_pair(X20,X21))
| ~ member(X19,universal_class)
| X19 != X20 )
& ( ~ member(X19,unordered_pair(X20,X21))
| X19 = X21
| X19 = X20 )
& ( ~ member(X19,unordered_pair(X20,X21))
| member(X19,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_9,negated_conjecture,
( esk8_0 != esk10_0
& member(esk8_0,universal_class)
& ordered_pair(esk8_0,esk9_0) = ordered_pair(esk10_0,esk11_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_10,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
ordered_pair(esk8_0,esk9_0) = ordered_pair(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
fof(c_0_15,plain,
! [X22,X23] : member(unordered_pair(X22,X23),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
unordered_pair(unordered_pair(esk10_0,esk10_0),unordered_pair(esk10_0,unordered_pair(esk11_0,esk11_0))) = unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
member(unordered_pair(esk10_0,esk10_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
( unordered_pair(esk10_0,esk10_0) = unordered_pair(esk8_0,esk8_0)
| unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)) = unordered_pair(esk10_0,esk10_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
member(esk8_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( member(esk8_0,unordered_pair(esk10_0,esk10_0))
| unordered_pair(esk10_0,esk10_0) = unordered_pair(esk8_0,esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_22])]) ).
cnf(c_0_24,negated_conjecture,
esk8_0 != esk10_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
unordered_pair(esk10_0,esk10_0) = unordered_pair(esk8_0,esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(X1,unordered_pair(esk8_0,esk8_0))
| X1 = esk10_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_28,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET016+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.36 % Computer : n011.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8046.5625MB
% 0.13/0.36 % OS : Linux 6.8.0-71-generic
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Sep 21 04:42:40 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.24/0.50 % Version: 3.5.1
% 0.24/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.50 % Starting sh5l with 300s (1) cores
% 0.24/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 989538 completed with status 0
% 0.24/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.50 % No SInE strategy applied
% 0.24/0.50 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.24/0.50 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.24/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.24/0.50 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.24/0.50 % G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 989550 completed with status 0
% 0.24/0.50 % Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.24/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.50 % No SInE strategy applied
% 0.24/0.50 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.24/0.50 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.24/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.24/0.50 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.24/0.50 % Preprocessing time : 0.003 s
% 0.24/0.50 % Presaturation interreduction done
% 0.24/0.50
% 0.24/0.50 % Proof found!
% 0.24/0.50 % SZS status Theorem
% 0.24/0.50 % SZS output start CNFRefutation
% See solution above
% 0.24/0.50 % Parsed axioms : 44
% 0.24/0.50 % Removed by relevancy pruning/SinE : 0
% 0.24/0.50 % Initial clauses : 92
% 0.24/0.50 % Removed in clause preprocessing : 8
% 0.24/0.50 % Initial clauses in saturation : 84
% 0.24/0.50 % Processed clauses : 163
% 0.24/0.50 % ...of these trivial : 0
% 0.24/0.50 % ...subsumed : 6
% 0.24/0.50 % ...remaining for further processing : 157
% 0.24/0.50 % Other redundant clauses eliminated : 6
% 0.24/0.50 % Clauses deleted for lack of memory : 0
% 0.24/0.50 % Backward-subsumed : 0
% 0.24/0.50 % Backward-rewritten : 4
% 0.24/0.50 % Generated clauses : 139
% 0.24/0.50 % ...of the previous two non-redundant : 118
% 0.24/0.50 % ...aggressively subsumed : 0
% 0.24/0.50 % Contextual simplify-reflections : 0
% 0.24/0.50 % Paramodulations : 132
% 0.24/0.50 % Factorizations : 1
% 0.24/0.50 % NegExts : 0
% 0.24/0.50 % Equation resolutions : 6
% 0.24/0.50 % Disequality decompositions : 0
% 0.24/0.50 % Total rewrite steps : 28
% 0.24/0.50 % ...of those cached : 13
% 0.24/0.50 % Propositional unsat checks : 0
% 0.24/0.50 % Propositional check models : 0
% 0.24/0.50 % Propositional check unsatisfiable : 0
% 0.24/0.50 % Propositional clauses : 0
% 0.24/0.50 % Propositional clauses after purity: 0
% 0.24/0.50 % Propositional unsat core size : 0
% 0.24/0.50 % Propositional preprocessing time : 0.000
% 0.24/0.50 % Propositional encoding time : 0.000
% 0.24/0.50 % Propositional solver time : 0.000
% 0.24/0.50 % Success case prop preproc time : 0.000
% 0.24/0.50 % Success case prop encoding time : 0.000
% 0.24/0.50 % Success case prop solver time : 0.000
% 0.24/0.50 % Current number of processed clauses : 64
% 0.24/0.50 % Positive orientable unit clauses : 16
% 0.24/0.50 % Positive unorientable unit clauses: 0
% 0.24/0.50 % Negative unit clauses : 2
% 0.24/0.50 % Non-unit-clauses : 46
% 0.24/0.50 % Current number of unprocessed clauses: 120
% 0.24/0.50 % ...number of literals in the above : 287
% 0.24/0.50 % Current number of archived formulas : 0
% 0.24/0.50 % Current number of archived clauses : 95
% 0.24/0.50 % Clause-clause subsumption calls (NU) : 1066
% 0.24/0.50 % Rec. Clause-clause subsumption calls : 977
% 0.24/0.50 % Non-unit clause-clause subsumptions : 3
% 0.24/0.50 % Unit Clause-clause subsumption calls : 19
% 0.24/0.50 % Rewrite failures with RHS unbound : 0
% 0.24/0.50 % BW rewrite match attempts : 2
% 0.24/0.50 % BW rewrite match successes : 1
% 0.24/0.50 % Condensation attempts : 0
% 0.24/0.50 % Condensation successes : 0
% 0.24/0.50 % Termbank termtop insertions : 8972
% 0.24/0.50 % Search garbage collected termcells : 997
% 0.24/0.50
% 0.24/0.50 % -------------------------------------------------
% 0.24/0.50 % User time : 0.020 s
% 0.24/0.50 % System time : 0.003 s
% 0.24/0.50 % Total time : 0.023 s
% 0.24/0.50 % Maximum resident set size: 3436 pages
% 0.24/0.50
% 0.24/0.50 % -------------------------------------------------
% 0.24/0.50 % User time : 0.128 s
% 0.24/0.50 % System time : 0.027 s
% 0.24/0.50 % Total time : 0.155 s
% 0.24/0.50 % Maximum resident set size: 4864 pages
% 0.24/0.50 % E exiting
%------------------------------------------------------------------------------