%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET071-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:25 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 23 unt; 9 nHn; 21 RR)
% Number of literals : 59 ( 28 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_null_unordered_pair_3,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_3) ).
cnf(unordered_pair_equals_singleton1,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_null_unordered_pair_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_2) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_null_unordered_pair_1,negated_conjecture,
unordered_pair(x,y) != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_unordered_pair_1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(c_0_10,negated_conjecture,
~ member(y,universal_class),
inference(fof_simplification,[status(thm)],[prove_null_unordered_pair_3]) ).
cnf(c_0_11,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_12,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_13,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_null_unordered_pair_2]) ).
cnf(c_0_14,negated_conjecture,
~ member(y,universal_class),
c_0_10 ).
cnf(c_0_15,plain,
( member(X1,universal_class)
| unordered_pair(X2,X1) = unordered_pair(X2,X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ member(x,universal_class),
c_0_13 ).
cnf(c_0_17,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_18,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_19,negated_conjecture,
unordered_pair(X1,y) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
unordered_pair(X1,x) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_22,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
unordered_pair(X1,X1) = unordered_pair(y,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
unordered_pair(X1,X1) = unordered_pair(x,X1),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
unordered_pair(x,y) != null_class,
inference(fof_simplification,[status(thm)],[prove_null_unordered_pair_1]) ).
cnf(c_0_26,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_21 ).
cnf(c_0_27,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_28,negated_conjecture,
( ~ member(X1,unordered_pair(X2,x))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
unordered_pair(y,X1) = unordered_pair(x,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
unordered_pair(x,y) != null_class,
c_0_25 ).
cnf(c_0_31,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_33,negated_conjecture,
( ~ member(X1,unordered_pair(x,x))
| X1 = y ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
unordered_pair(x,x) != null_class,
inference(rw,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_35,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
regular(unordered_pair(x,x)) = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_34]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET071-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:50:26 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1004579 completed with status 0
% 0.14/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 311s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 308s (1) cores
% 0.14/0.45 % Starting sh5l with 304s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 1004588 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Preprocessing time : 0.003 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Unsatisfiable
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 115
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 115
% 0.14/0.45 % Removed in clause preprocessing : 15
% 0.14/0.45 % Initial clauses in saturation : 100
% 0.14/0.45 % Processed clauses : 174
% 0.14/0.45 % ...of these trivial : 18
% 0.14/0.45 % ...subsumed : 63
% 0.14/0.45 % ...remaining for further processing : 93
% 0.14/0.45 % Other redundant clauses eliminated : 2
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 0
% 0.14/0.45 % Backward-rewritten : 10
% 0.14/0.45 % Generated clauses : 652
% 0.14/0.45 % ...of the previous two non-redundant : 365
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 648
% 0.14/0.45 % Factorizations : 2
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 2
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 443
% 0.14/0.45 % ...of those cached : 384
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 81
% 0.14/0.45 % Positive orientable unit clauses : 25
% 0.14/0.45 % Positive unorientable unit clauses: 4
% 0.14/0.45 % Negative unit clauses : 4
% 0.14/0.45 % Non-unit-clauses : 48
% 0.14/0.45 % Current number of unprocessed clauses: 244
% 0.14/0.45 % ...number of literals in the above : 575
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 25
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 346
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 220
% 0.14/0.45 % Non-unit clause-clause subsumptions : 21
% 0.14/0.45 % Unit Clause-clause subsumption calls : 59
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 50
% 0.14/0.45 % BW rewrite match successes : 22
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 9125
% 0.14/0.45 % Search garbage collected termcells : 179
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.013 s
% 0.14/0.45 % System time : 0.008 s
% 0.14/0.45 % Total time : 0.020 s
% 0.14/0.45 % Maximum resident set size: 3984 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.055 s
% 0.14/0.45 % System time : 0.027 s
% 0.14/0.45 % Total time : 0.083 s
% 0.14/0.45 % Maximum resident set size: 4608 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------