%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET105-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 : n019.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:37 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.55s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 23 unt; 6 nHn; 15 RR)
% Number of literals : 35 ( 22 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_property_3_of_ordered_pair_1,negated_conjecture,
unordered_pair(null_class,singleton(null_class)) != ordered_pair(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_3_of_ordered_pair_1) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_property_3_of_ordered_pair_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_3_of_ordered_pair_2) ).
cnf(singleton_is_null_class,axiom,
( singleton(X1) = null_class
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).
cnf(prove_property_3_of_ordered_pair_3,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_3_of_ordered_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(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(c_0_8,negated_conjecture,
unordered_pair(null_class,singleton(null_class)) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_property_3_of_ordered_pair_1]) ).
cnf(c_0_9,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_10,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_11,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_property_3_of_ordered_pair_2]) ).
cnf(c_0_12,axiom,
( singleton(X1) = null_class
| member(X1,universal_class) ),
singleton_is_null_class ).
cnf(c_0_13,negated_conjecture,
~ member(y,universal_class),
inference(fof_simplification,[status(thm)],[prove_property_3_of_ordered_pair_3]) ).
cnf(c_0_14,negated_conjecture,
unordered_pair(null_class,singleton(null_class)) != ordered_pair(x,y),
c_0_8 ).
cnf(c_0_15,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ member(x,universal_class),
c_0_11 ).
cnf(c_0_17,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = null_class ),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
~ member(y,universal_class),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
unordered_pair(null_class,unordered_pair(null_class,null_class)) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_10]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
unordered_pair(y,y) = null_class,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_23,negated_conjecture,
unordered_pair(null_class,unordered_pair(x,null_class)) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_25,plain,
( member(X1,universal_class)
| unordered_pair(X2,X1) = unordered_pair(X2,X2) ),
inference(rw,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
unordered_pair(null_class,unordered_pair(null_class,x)) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
unordered_pair(X1,x) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET105-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.38 % Computer : n019.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:53:35 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.45 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.16/0.55 % Version: 3.5.1
% 0.16/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.55 % Starting sh5l with 300s (1) cores
% 0.16/0.55 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1726480 completed with status 0
% 0.16/0.55 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.55 % No SInE strategy applied
% 0.16/0.55 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.55 % Starting new_bool_3 with 311s (1) cores
% 0.16/0.55 % Starting new_bool_1 with 308s (1) cores
% 0.16/0.55 % Starting sh5l with 304s (1) cores
% 0.16/0.55 % sh5l with pid 1726490 completed with status 0
% 0.16/0.55 % Result found by sh5l
% 0.16/0.55 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.55 % No SInE strategy applied
% 0.16/0.55 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.55 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.55 % Starting new_bool_3 with 311s (1) cores
% 0.16/0.55 % Starting new_bool_1 with 308s (1) cores
% 0.16/0.55 % Starting sh5l with 304s (1) cores
% 0.16/0.55 % Preprocessing time : 0.005 s
% 0.16/0.55 % Presaturation interreduction done
% 0.16/0.55
% 0.16/0.55 % Proof found!
% 0.16/0.55 % SZS status Unsatisfiable
% 0.16/0.55 % SZS output start CNFRefutation
% See solution above
% 0.16/0.56 % Parsed axioms : 150
% 0.16/0.56 % Removed by relevancy pruning/SinE : 0
% 0.16/0.56 % Initial clauses : 150
% 0.16/0.56 % Removed in clause preprocessing : 15
% 0.16/0.56 % Initial clauses in saturation : 135
% 0.16/0.56 % Processed clauses : 562
% 0.16/0.56 % ...of these trivial : 17
% 0.16/0.56 % ...subsumed : 248
% 0.16/0.56 % ...remaining for further processing : 297
% 0.16/0.56 % Other redundant clauses eliminated : 35
% 0.16/0.56 % Clauses deleted for lack of memory : 0
% 0.16/0.56 % Backward-subsumed : 2
% 0.16/0.56 % Backward-rewritten : 11
% 0.16/0.56 % Generated clauses : 1436
% 0.16/0.56 % ...of the previous two non-redundant : 975
% 0.16/0.56 % ...aggressively subsumed : 0
% 0.16/0.56 % Contextual simplify-reflections : 0
% 0.16/0.56 % Paramodulations : 1398
% 0.16/0.56 % Factorizations : 2
% 0.16/0.56 % NegExts : 0
% 0.16/0.56 % Equation resolutions : 36
% 0.16/0.56 % Disequality decompositions : 0
% 0.16/0.56 % Total rewrite steps : 520
% 0.16/0.56 % ...of those cached : 423
% 0.16/0.56 % Propositional unsat checks : 0
% 0.16/0.56 % Propositional check models : 0
% 0.16/0.56 % Propositional check unsatisfiable : 0
% 0.16/0.56 % Propositional clauses : 0
% 0.16/0.56 % Propositional clauses after purity: 0
% 0.16/0.56 % Propositional unsat core size : 0
% 0.16/0.56 % Propositional preprocessing time : 0.000
% 0.16/0.56 % Propositional encoding time : 0.000
% 0.16/0.56 % Propositional solver time : 0.000
% 0.16/0.56 % Success case prop preproc time : 0.000
% 0.16/0.56 % Success case prop encoding time : 0.000
% 0.16/0.56 % Success case prop solver time : 0.000
% 0.16/0.56 % Current number of processed clauses : 154
% 0.16/0.56 % Positive orientable unit clauses : 33
% 0.16/0.56 % Positive unorientable unit clauses: 4
% 0.16/0.56 % Negative unit clauses : 14
% 0.16/0.56 % Non-unit-clauses : 103
% 0.16/0.56 % Current number of unprocessed clauses: 674
% 0.16/0.56 % ...number of literals in the above : 1668
% 0.16/0.56 % Current number of archived formulas : 0
% 0.16/0.56 % Current number of archived clauses : 155
% 0.16/0.56 % Clause-clause subsumption calls (NU) : 4186
% 0.16/0.56 % Rec. Clause-clause subsumption calls : 2468
% 0.16/0.56 % Non-unit clause-clause subsumptions : 158
% 0.16/0.56 % Unit Clause-clause subsumption calls : 199
% 0.16/0.56 % Rewrite failures with RHS unbound : 0
% 0.16/0.56 % BW rewrite match attempts : 147
% 0.16/0.56 % BW rewrite match successes : 81
% 0.16/0.56 % Condensation attempts : 562
% 0.16/0.56 % Condensation successes : 0
% 0.16/0.56 % Termbank termtop insertions : 19488
% 0.16/0.56 % Search garbage collected termcells : 233
% 0.16/0.56
% 0.16/0.56 % -------------------------------------------------
% 0.16/0.56 % User time : 0.068 s
% 0.16/0.56 % System time : 0.012 s
% 0.16/0.56 % Total time : 0.079 s
% 0.16/0.56 % Maximum resident set size: 4008 pages
% 0.16/0.56
% 0.16/0.56 % -------------------------------------------------
% 0.16/0.56 % User time : 0.236 s
% 0.16/0.56 % System time : 0.036 s
% 0.16/0.56 % Total time : 0.271 s
% 0.16/0.56 % Maximum resident set size: 4864 pages
% 0.16/0.56 % E exiting
%------------------------------------------------------------------------------