%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET104-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 : n013.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:36 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 17 unt; 6 nHn; 9 RR)
% Number of literals : 29 ( 19 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 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_2_of_ordered_pair_2,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_2_of_ordered_pair_2) ).
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_2_of_ordered_pair_3,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_2_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(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(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_7,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_property_2_of_ordered_pair_2]) ).
cnf(c_0_8,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_9,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_10,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_property_2_of_ordered_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,
( singleton(X1) = null_class
| member(X1,universal_class) ),
singleton_is_null_class ).
cnf(c_0_13,negated_conjecture,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
c_0_7 ).
cnf(c_0_14,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_8,c_0_9]),c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ member(x,universal_class),
c_0_10 ).
cnf(c_0_16,plain,
( member(X1,universal_class)
| unordered_pair(X2,X1) = unordered_pair(X2,X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_17,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = null_class ),
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
unordered_pair(null_class,unordered_pair(unordered_pair(y,y),unordered_pair(y,y))) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9]),c_0_9]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
unordered_pair(X1,x) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_21,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET104-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 04:52:50 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4176410 completed with status 0
% 0.14/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.46 % Starting new_bool_3 with 311s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 308s (1) cores
% 0.14/0.46 % Starting sh5l with 304s (1) cores
% 0.14/0.46 % SubtermCWHack with pid 4176415 completed with status 0
% 0.14/0.46 % Result found by SubtermCWHack
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Preprocessing time : 0.003 s
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Unsatisfiable
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 149
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 149
% 0.14/0.46 % Removed in clause preprocessing : 15
% 0.14/0.46 % Initial clauses in saturation : 134
% 0.14/0.46 % Processed clauses : 528
% 0.14/0.46 % ...of these trivial : 44
% 0.14/0.46 % ...subsumed : 311
% 0.14/0.46 % ...remaining for further processing : 172
% 0.14/0.46 % Other redundant clauses eliminated : 2
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 5
% 0.14/0.46 % Backward-rewritten : 4
% 0.14/0.46 % Generated clauses : 1594
% 0.14/0.46 % ...of the previous two non-redundant : 1106
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 1588
% 0.14/0.46 % Factorizations : 4
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 2
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 723
% 0.14/0.46 % ...of those cached : 632
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 161
% 0.14/0.46 % Positive orientable unit clauses : 37
% 0.14/0.46 % Positive unorientable unit clauses: 4
% 0.14/0.46 % Negative unit clauses : 13
% 0.14/0.46 % Non-unit-clauses : 107
% 0.14/0.46 % Current number of unprocessed clauses: 689
% 0.14/0.46 % ...number of literals in the above : 1834
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 24
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 2560
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 1671
% 0.14/0.46 % Non-unit clause-clause subsumptions : 174
% 0.14/0.46 % Unit Clause-clause subsumption calls : 103
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 41
% 0.14/0.46 % BW rewrite match successes : 17
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 18833
% 0.14/0.46 % Search garbage collected termcells : 231
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.028 s
% 0.14/0.46 % System time : 0.006 s
% 0.14/0.46 % Total time : 0.034 s
% 0.14/0.46 % Maximum resident set size: 3752 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.125 s
% 0.14/0.46 % System time : 0.022 s
% 0.14/0.46 % Total time : 0.146 s
% 0.14/0.46 % Maximum resident set size: 4864 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------