%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET101+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 : n009.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:32 PM UTC 2026
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 36 ( 13 equ)
% Maximal formula atoms : 11 ( 1 avg)
% Number of connectives : 28 ( 12 ~; 11 |; 4 &)
% ( 1 <=>; 0 =>; 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 6 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/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(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(singleton_member_of_ordered_pair,conjecture,
! [X1,X2] : member(singleton(X1),ordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_member_of_ordered_pair) ).
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(c_0_5,plain,
! [X45,X46,X47] :
( ( member(X45,unordered_pair(X46,X47))
| ~ member(X45,universal_class)
| X45 != X47 )
& ( member(X45,unordered_pair(X46,X47))
| ~ member(X45,universal_class)
| X45 != X46 )
& ( ~ member(X45,unordered_pair(X46,X47))
| X45 = X47
| X45 = X46 )
& ( ~ member(X45,unordered_pair(X46,X47))
| member(X45,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_6,plain,
! [X48,X49] : member(unordered_pair(X48,X49),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
fof(c_0_7,plain,
! [X32] : singleton(X32) = unordered_pair(X32,X32),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] : member(singleton(X1),ordered_pair(X1,X2)),
inference(assume_negation,[status(cth)],[singleton_member_of_ordered_pair]) ).
cnf(c_0_9,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X22,X23] : ordered_pair(X22,X23) = unordered_pair(singleton(X22),unordered_pair(X22,singleton(X23))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
cnf(c_0_11,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,negated_conjecture,
~ member(singleton(esk1_0),ordered_pair(esk1_0,esk2_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
member(singleton(X1),universal_class),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ member(singleton(esk1_0),ordered_pair(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
member(singleton(X1),ordered_pair(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET101+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n009.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 04:53:12 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % sh5l with pid 884903 completed with status 0
% 0.15/0.44 % Result found by sh5l
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 884909 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.44 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.44 % Preprocessing time : 0.002 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Theorem
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 44
% 0.15/0.44 % Removed by relevancy pruning/SinE : 9
% 0.15/0.44 % Initial clauses : 72
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 72
% 0.15/0.44 % Processed clauses : 134
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 30
% 0.15/0.44 % ...remaining for further processing : 104
% 0.15/0.44 % Other redundant clauses eliminated : 5
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 5
% 0.15/0.44 % Backward-rewritten : 6
% 0.15/0.44 % Generated clauses : 230
% 0.15/0.44 % ...of the previous two non-redundant : 207
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 225
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 5
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 29
% 0.15/0.44 % ...of those cached : 13
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 88
% 0.15/0.44 % Positive orientable unit clauses : 27
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 1
% 0.15/0.44 % Non-unit-clauses : 60
% 0.15/0.44 % Current number of unprocessed clauses: 136
% 0.15/0.44 % ...number of literals in the above : 332
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 11
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 735
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 636
% 0.15/0.44 % Non-unit clause-clause subsumptions : 29
% 0.15/0.44 % Unit Clause-clause subsumption calls : 47
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 8
% 0.15/0.44 % BW rewrite match successes : 4
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 6498
% 0.15/0.44 % Search garbage collected termcells : 863
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.013 s
% 0.15/0.44 % System time : 0.004 s
% 0.15/0.44 % Total time : 0.017 s
% 0.15/0.44 % Maximum resident set size: 3692 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.014 s
% 0.15/0.44 % System time : 0.010 s
% 0.15/0.44 % Total time : 0.024 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------