%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET081+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:13:29 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 31 ( 15 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 28 ( 10 ~; 10 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(only_member_in_singleton,conjecture,
! [X1,X2] :
( member(X2,singleton(X1))
=> X2 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',only_member_in_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(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(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( member(X2,singleton(X1))
=> X2 = X1 ),
inference(assume_negation,[status(cth)],[only_member_in_singleton]) ).
fof(c_0_4,negated_conjecture,
( esk9_0 != esk8_0
& member(esk9_0,singleton(esk8_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_6,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])])])]) ).
cnf(c_0_7,negated_conjecture,
member(esk9_0,singleton(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
member(esk9_0,unordered_pair(esk8_0,esk8_0)),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk9_0 != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
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.03 % Problem : SET081+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.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.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 04:50:43 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 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.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 879541 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.13/0.44 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.13/0.44 % SubtermCWHack with pid 879554 completed with status 0
% 0.13/0.44 % Result found by SubtermCWHack
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.13/0.44 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.001 s
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Theorem
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 44
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 91
% 0.13/0.44 % Removed in clause preprocessing : 8
% 0.13/0.44 % Initial clauses in saturation : 83
% 0.13/0.44 % Processed clauses : 99
% 0.13/0.44 % ...of these trivial : 0
% 0.13/0.44 % ...subsumed : 23
% 0.13/0.44 % ...remaining for further processing : 76
% 0.13/0.44 % Other redundant clauses eliminated : 4
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 4
% 0.13/0.44 % Backward-rewritten : 2
% 0.13/0.44 % Generated clauses : 169
% 0.13/0.44 % ...of the previous two non-redundant : 146
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 165
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 4
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 12
% 0.13/0.44 % ...of those cached : 4
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 66
% 0.13/0.44 % Positive orientable unit clauses : 21
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 2
% 0.13/0.44 % Non-unit-clauses : 43
% 0.13/0.44 % Current number of unprocessed clauses: 123
% 0.13/0.44 % ...number of literals in the above : 296
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 14
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 372
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 343
% 0.13/0.44 % Non-unit clause-clause subsumptions : 20
% 0.13/0.44 % Unit Clause-clause subsumption calls : 72
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 4
% 0.13/0.44 % BW rewrite match successes : 2
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 7539
% 0.13/0.44 % Search garbage collected termcells : 978
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.010 s
% 0.13/0.44 % System time : 0.005 s
% 0.13/0.44 % Total time : 0.014 s
% 0.13/0.44 % Maximum resident set size: 3948 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.020 s
% 0.13/0.44 % System time : 0.021 s
% 0.13/0.44 % Total time : 0.041 s
% 0.13/0.44 % Maximum resident set size: 4864 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------