%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET074+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 : n018.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:26 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 35 ( 12 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 38 ( 18 ~; 11 |; 5 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 3 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(corollary1_2,conjecture,
! [X1,X2] :
( member(X2,universal_class)
=> unordered_pair(X1,X2) != null_class ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary1_2) ).
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(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( member(X2,universal_class)
=> unordered_pair(X1,X2) != null_class ),
inference(assume_negation,[status(cth)],[corollary1_2]) ).
fof(c_0_4,plain,
! [X13,X14,X15] :
( ( member(X13,unordered_pair(X14,X15))
| ~ member(X13,universal_class)
| X13 != X15 )
& ( member(X13,unordered_pair(X14,X15))
| ~ member(X13,universal_class)
| X13 != X14 )
& ( ~ member(X13,unordered_pair(X14,X15))
| X13 = X15
| X13 = X14 )
& ( ~ member(X13,unordered_pair(X14,X15))
| member(X13,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_5,negated_conjecture,
~ ! [X1,X2] :
( member(X2,universal_class)
=> unordered_pair(X1,X2) != null_class ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
cnf(c_0_7,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( unordered_pair(esk1_0,esk2_0) = null_class
& member(esk2_0,universal_class) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X12] : ~ member(X12,null_class),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
cnf(c_0_10,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
unordered_pair(esk1_0,esk2_0) = null_class,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET074+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.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:52:29 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_3 with pid 999668 completed with status 0
% 0.10/0.44 % Result found by new_bool_3
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUSS-FFSF21-MFFFFFNN
% 0.10/0.44 % partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.10/0.44 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 999671 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUSS-FFSF21-MFFFFFNN
% 0.10/0.44 % partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.10/0.44 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 44
% 0.10/0.44 % Removed by relevancy pruning/SinE : 37
% 0.10/0.44 % Initial clauses : 13
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 13
% 0.10/0.44 % Processed clauses : 13
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 2
% 0.10/0.44 % ...remaining for further processing : 11
% 0.10/0.44 % Other redundant clauses eliminated : 1
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 10
% 0.10/0.44 % ...of the previous two non-redundant : 6
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 9
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 1
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 2
% 0.10/0.44 % ...of those cached : 0
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 10
% 0.10/0.44 % Positive orientable unit clauses : 5
% 0.10/0.44 % Positive unorientable unit clauses: 1
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 3
% 0.10/0.44 % Current number of unprocessed clauses: 6
% 0.10/0.44 % ...number of literals in the above : 14
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 0
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 3
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 3
% 0.10/0.44 % Non-unit clause-clause subsumptions : 1
% 0.10/0.44 % Unit Clause-clause subsumption calls : 0
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 2
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 1128
% 0.10/0.44 % Search garbage collected termcells : 404
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.003 s
% 0.10/0.44 % System time : 0.003 s
% 0.10/0.44 % Total time : 0.006 s
% 0.10/0.44 % Maximum resident set size: 3640 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.004 s
% 0.10/0.44 % System time : 0.009 s
% 0.10/0.44 % Total time : 0.013 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------