%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET024+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 : n002.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:07 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 34 ( 10 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 33 ( 13 ~; 12 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn 10 !; 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(set_in_its_singleton,conjecture,
! [X1] :
( member(X1,universal_class)
=> member(X1,singleton(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',set_in_its_singleton) ).
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(c_0_3,plain,
! [X61,X62,X63] :
( ( member(X61,unordered_pair(X62,X63))
| ~ member(X61,universal_class)
| X61 != X63 )
& ( member(X61,unordered_pair(X62,X63))
| ~ member(X61,universal_class)
| X61 != X62 )
& ( ~ member(X61,unordered_pair(X62,X63))
| X61 = X63
| X61 = X62 )
& ( ~ member(X61,unordered_pair(X62,X63))
| member(X61,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,negated_conjecture,
~ ! [X1] :
( member(X1,universal_class)
=> member(X1,singleton(X1)) ),
inference(assume_negation,[status(cth)],[set_in_its_singleton]) ).
cnf(c_0_5,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X21] : singleton(X21) = unordered_pair(X21,X21),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_7,negated_conjecture,
( ~ member(esk1_0,singleton(esk1_0))
& 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_4])])])]) ).
cnf(c_0_8,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ member(esk1_0,singleton(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ member(X1,universal_class)
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
member(esk1_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET024+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.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 04:46:31 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.43 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % sh5l with pid 2455527 completed with status 0
% 0.11/0.45 % Result found by sh5l
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.11/0.45 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 2455537 completed with status 0
% 0.11/0.46 % Result found by SubtermCWHack
% 0.11/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.11/0.46 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46 % Preprocessing time : 0.001 s
% 0.11/0.46
% 0.11/0.46 % Proof found!
% 0.11/0.46 % SZS status Theorem
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.11/0.46 % Parsed axioms : 44
% 0.11/0.46 % Removed by relevancy pruning/SinE : 3
% 0.11/0.46 % Initial clauses : 84
% 0.11/0.46 % Removed in clause preprocessing : 0
% 0.11/0.46 % Initial clauses in saturation : 84
% 0.11/0.46 % Processed clauses : 92
% 0.11/0.46 % ...of these trivial : 0
% 0.11/0.46 % ...subsumed : 15
% 0.11/0.46 % ...remaining for further processing : 77
% 0.11/0.46 % Other redundant clauses eliminated : 4
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 5
% 0.11/0.46 % Backward-rewritten : 1
% 0.11/0.46 % Generated clauses : 113
% 0.11/0.46 % ...of the previous two non-redundant : 100
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 0
% 0.11/0.46 % Paramodulations : 109
% 0.11/0.46 % Factorizations : 0
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 4
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 10
% 0.11/0.46 % ...of those cached : 2
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 67
% 0.11/0.46 % Positive orientable unit clauses : 24
% 0.11/0.46 % Positive unorientable unit clauses: 0
% 0.11/0.46 % Negative unit clauses : 2
% 0.11/0.46 % Non-unit-clauses : 41
% 0.11/0.46 % Current number of unprocessed clauses: 92
% 0.11/0.46 % ...number of literals in the above : 212
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 6
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 372
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 313
% 0.11/0.46 % Non-unit clause-clause subsumptions : 19
% 0.11/0.46 % Unit Clause-clause subsumption calls : 11
% 0.11/0.46 % Rewrite failures with RHS unbound : 0
% 0.11/0.46 % BW rewrite match attempts : 6
% 0.11/0.46 % BW rewrite match successes : 1
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 6031
% 0.11/0.46 % Search garbage collected termcells : 928
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.008 s
% 0.11/0.46 % System time : 0.005 s
% 0.11/0.46 % Total time : 0.012 s
% 0.11/0.46 % Maximum resident set size: 3948 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.011 s
% 0.11/0.46 % System time : 0.008 s
% 0.11/0.46 % Total time : 0.019 s
% 0.11/0.46 % Maximum resident set size: 4864 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------