%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET117+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 : n019.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:38 PM UTC 2026
% Result : Theorem 0.28s 0.62s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 16 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 4 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(ordered_pair_defn,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(corollary_1_to_ordered_pairs_are_sets,conjecture,
! [X1] :
( ordered_pair(first(X1),second(X1)) = X1
=> member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_1_to_ordered_pairs_are_sets) ).
fof(c_0_3,plain,
! [X46,X47] : member(unordered_pair(X46,X47),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
fof(c_0_4,plain,
! [X22,X23] : ordered_pair(X22,X23) = unordered_pair(singleton(X22),unordered_pair(X22,singleton(X23))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ordered_pair(first(X1),second(X1)) = X1
=> member(X1,universal_class) ),
inference(assume_negation,[status(cth)],[corollary_1_to_ordered_pairs_are_sets]) ).
cnf(c_0_6,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( ~ member(esk1_0,universal_class)
& ordered_pair(first(esk1_0),second(esk1_0)) = esk1_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_9,plain,
member(ordered_pair(X1,X2),universal_class),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
ordered_pair(first(esk1_0),second(esk1_0)) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ member(esk1_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET117+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n019.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 04:54:49 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.54 Running first-order theorem proving
% 0.28/0.54 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.28/0.62 % Version: 3.5.1
% 0.28/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.62 % Starting sh5l with 300s (1) cores
% 0.28/0.62 % sh5l with pid 1728143 completed with status 0
% 0.28/0.62 % Result found by sh5l
% 0.28/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.62 % Starting sh5l with 300s (1) cores
% 0.28/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.28/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.28/0.62 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.28/0.62 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.62 % SubtermCWHack with pid 1728151 completed with status 0
% 0.28/0.62 % Result found by SubtermCWHack
% 0.28/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.62 % Starting sh5l with 300s (1) cores
% 0.28/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.28/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.28/0.62 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.28/0.62 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.62 % Preprocessing time : 0.003 s
% 0.28/0.62
% 0.28/0.62 % Proof found!
% 0.28/0.62 % SZS status Theorem
% 0.28/0.62 % SZS output start CNFRefutation
% See solution above
% 0.28/0.62 % Parsed axioms : 44
% 0.28/0.62 % Removed by relevancy pruning/SinE : 7
% 0.28/0.62 % Initial clauses : 76
% 0.28/0.62 % Removed in clause preprocessing : 0
% 0.28/0.62 % Initial clauses in saturation : 76
% 0.28/0.62 % Processed clauses : 159
% 0.28/0.62 % ...of these trivial : 1
% 0.28/0.62 % ...subsumed : 38
% 0.28/0.62 % ...remaining for further processing : 120
% 0.28/0.62 % Other redundant clauses eliminated : 5
% 0.28/0.62 % Clauses deleted for lack of memory : 0
% 0.28/0.62 % Backward-subsumed : 5
% 0.28/0.62 % Backward-rewritten : 6
% 0.28/0.62 % Generated clauses : 281
% 0.28/0.62 % ...of the previous two non-redundant : 258
% 0.28/0.62 % ...aggressively subsumed : 0
% 0.28/0.62 % Contextual simplify-reflections : 0
% 0.28/0.62 % Paramodulations : 276
% 0.28/0.62 % Factorizations : 0
% 0.28/0.62 % NegExts : 0
% 0.28/0.62 % Equation resolutions : 5
% 0.28/0.62 % Disequality decompositions : 0
% 0.28/0.62 % Total rewrite steps : 33
% 0.28/0.62 % ...of those cached : 16
% 0.28/0.62 % Propositional unsat checks : 0
% 0.28/0.62 % Propositional check models : 0
% 0.28/0.62 % Propositional check unsatisfiable : 0
% 0.28/0.62 % Propositional clauses : 0
% 0.28/0.62 % Propositional clauses after purity: 0
% 0.28/0.62 % Propositional unsat core size : 0
% 0.28/0.62 % Propositional preprocessing time : 0.000
% 0.28/0.62 % Propositional encoding time : 0.000
% 0.28/0.62 % Propositional solver time : 0.000
% 0.28/0.62 % Success case prop preproc time : 0.000
% 0.28/0.62 % Success case prop encoding time : 0.000
% 0.28/0.62 % Success case prop solver time : 0.000
% 0.28/0.62 % Current number of processed clauses : 104
% 0.28/0.62 % Positive orientable unit clauses : 29
% 0.28/0.62 % Positive unorientable unit clauses: 0
% 0.28/0.62 % Negative unit clauses : 2
% 0.28/0.62 % Non-unit-clauses : 73
% 0.28/0.62 % Current number of unprocessed clauses: 152
% 0.28/0.62 % ...number of literals in the above : 376
% 0.28/0.62 % Current number of archived formulas : 0
% 0.28/0.62 % Current number of archived clauses : 11
% 0.28/0.62 % Clause-clause subsumption calls (NU) : 962
% 0.28/0.62 % Rec. Clause-clause subsumption calls : 870
% 0.28/0.62 % Non-unit clause-clause subsumptions : 36
% 0.28/0.62 % Unit Clause-clause subsumption calls : 126
% 0.28/0.62 % Rewrite failures with RHS unbound : 0
% 0.28/0.62 % BW rewrite match attempts : 10
% 0.28/0.62 % BW rewrite match successes : 4
% 0.28/0.62 % Condensation attempts : 0
% 0.28/0.62 % Condensation successes : 0
% 0.28/0.62 % Termbank termtop insertions : 7286
% 0.28/0.62 % Search garbage collected termcells : 890
% 0.28/0.62
% 0.28/0.62 % -------------------------------------------------
% 0.28/0.62 % User time : 0.023 s
% 0.28/0.62 % System time : 0.005 s
% 0.28/0.62 % Total time : 0.028 s
% 0.28/0.62 % Maximum resident set size: 3948 pages
% 0.28/0.62
% 0.28/0.62 % -------------------------------------------------
% 0.28/0.62 % User time : 0.028 s
% 0.28/0.62 % System time : 0.010 s
% 0.28/0.62 % Total time : 0.038 s
% 0.28/0.62 % Maximum resident set size: 4864 pages
% 0.28/0.62 % E exiting
%------------------------------------------------------------------------------