%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET094+1 : TPTP v9.3.1. Bugfixed v7.3.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:16:30 PM UTC 2026
% Result : Theorem 0.23s 0.62s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 38 ( 21 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 35 ( 12 ~; 12 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 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 : 19 ( 0 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(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(property_of_singletons1_1,conjecture,
! [X1,X2] :
( ( member(X2,X1)
& singleton(member_of(X1)) = X1 )
=> member_of(X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_singletons1_1) ).
fof(c_0_3,plain,
! [X66,X67,X68] :
( ( member(X66,unordered_pair(X67,X68))
| ~ member(X66,universal_class)
| X66 != X68 )
& ( member(X66,unordered_pair(X67,X68))
| ~ member(X66,universal_class)
| X66 != X67 )
& ( ~ member(X66,unordered_pair(X67,X68))
| X66 = X68
| X66 = X67 )
& ( ~ member(X66,unordered_pair(X67,X68))
| member(X66,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,
! [X26] : singleton(X26) = unordered_pair(X26,X26),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ( member(X2,X1)
& singleton(member_of(X1)) = X1 )
=> member_of(X1) = X2 ),
inference(assume_negation,[status(cth)],[property_of_singletons1_1]) ).
cnf(c_0_6,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( member_of(esk1_0) != esk2_0
& member(esk2_0,esk1_0)
& singleton(member_of(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(X1,singleton(X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
singleton(member_of(esk1_0)) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ member(X1,esk1_0)
| X1 = member_of(esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
member(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
member_of(esk1_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET094+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n014.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 04:52:19 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.23/0.62 % Version: 3.5.1
% 0.23/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.62 % Starting sh5l with 300s (1) cores
% 0.23/0.62 % sh5l with pid 3177829 completed with status 0
% 0.23/0.62 % Result found by sh5l
% 0.23/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.62 % Starting sh5l with 300s (1) cores
% 0.23/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.62 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.23/0.62 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.62 % SubtermCWHack with pid 3177834 completed with status 0
% 0.23/0.62 % Result found by SubtermCWHack
% 0.23/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.62 % Starting sh5l with 300s (1) cores
% 0.23/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.62 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.62 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.23/0.62 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.62 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.62 % Preprocessing time : 0.003 s
% 0.23/0.62
% 0.23/0.62 % Proof found!
% 0.23/0.62 % SZS status Theorem
% 0.23/0.62 % SZS output start CNFRefutation
% See solution above
% 0.23/0.62 % Parsed axioms : 48
% 0.23/0.62 % Removed by relevancy pruning/SinE : 3
% 0.23/0.62 % Initial clauses : 89
% 0.23/0.62 % Removed in clause preprocessing : 0
% 0.23/0.62 % Initial clauses in saturation : 89
% 0.23/0.62 % Processed clauses : 148
% 0.23/0.62 % ...of these trivial : 0
% 0.23/0.62 % ...subsumed : 35
% 0.23/0.62 % ...remaining for further processing : 113
% 0.23/0.62 % Other redundant clauses eliminated : 5
% 0.23/0.62 % Clauses deleted for lack of memory : 0
% 0.23/0.62 % Backward-subsumed : 9
% 0.23/0.62 % Backward-rewritten : 4
% 0.23/0.62 % Generated clauses : 262
% 0.23/0.62 % ...of the previous two non-redundant : 231
% 0.23/0.62 % ...aggressively subsumed : 0
% 0.23/0.62 % Contextual simplify-reflections : 0
% 0.23/0.62 % Paramodulations : 257
% 0.23/0.62 % Factorizations : 0
% 0.23/0.62 % NegExts : 0
% 0.23/0.62 % Equation resolutions : 5
% 0.23/0.62 % Disequality decompositions : 0
% 0.23/0.62 % Total rewrite steps : 33
% 0.23/0.62 % ...of those cached : 18
% 0.23/0.62 % Propositional unsat checks : 0
% 0.23/0.62 % Propositional check models : 0
% 0.23/0.62 % Propositional check unsatisfiable : 0
% 0.23/0.62 % Propositional clauses : 0
% 0.23/0.62 % Propositional clauses after purity: 0
% 0.23/0.62 % Propositional unsat core size : 0
% 0.23/0.62 % Propositional preprocessing time : 0.000
% 0.23/0.62 % Propositional encoding time : 0.000
% 0.23/0.62 % Propositional solver time : 0.000
% 0.23/0.62 % Success case prop preproc time : 0.000
% 0.23/0.62 % Success case prop encoding time : 0.000
% 0.23/0.62 % Success case prop solver time : 0.000
% 0.23/0.62 % Current number of processed clauses : 95
% 0.23/0.62 % Positive orientable unit clauses : 29
% 0.23/0.62 % Positive unorientable unit clauses: 0
% 0.23/0.62 % Negative unit clauses : 2
% 0.23/0.62 % Non-unit-clauses : 64
% 0.23/0.62 % Current number of unprocessed clauses: 163
% 0.23/0.62 % ...number of literals in the above : 400
% 0.23/0.62 % Current number of archived formulas : 0
% 0.23/0.62 % Current number of archived clauses : 13
% 0.23/0.62 % Clause-clause subsumption calls (NU) : 589
% 0.23/0.62 % Rec. Clause-clause subsumption calls : 510
% 0.23/0.62 % Non-unit clause-clause subsumptions : 38
% 0.23/0.62 % Unit Clause-clause subsumption calls : 69
% 0.23/0.62 % Rewrite failures with RHS unbound : 0
% 0.23/0.62 % BW rewrite match attempts : 7
% 0.23/0.62 % BW rewrite match successes : 2
% 0.23/0.62 % Condensation attempts : 0
% 0.23/0.62 % Condensation successes : 0
% 0.23/0.62 % Termbank termtop insertions : 7732
% 0.23/0.62 % Search garbage collected termcells : 953
% 0.23/0.62
% 0.23/0.62 % -------------------------------------------------
% 0.23/0.62 % User time : 0.016 s
% 0.23/0.62 % System time : 0.006 s
% 0.23/0.62 % Total time : 0.021 s
% 0.23/0.62 % Maximum resident set size: 3948 pages
% 0.23/0.62
% 0.23/0.62 % -------------------------------------------------
% 0.23/0.62 % User time : 0.017 s
% 0.23/0.62 % System time : 0.010 s
% 0.23/0.62 % Total time : 0.028 s
% 0.23/0.62 % Maximum resident set size: 4608 pages
% 0.23/0.62 % E exiting
%------------------------------------------------------------------------------