%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET016-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:05 PM UTC 2026
% Result : Unsatisfiable 0.58s 0.51s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 18 unt; 6 nHn; 17 RR)
% Number of literals : 45 ( 26 equ; 14 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 : 33 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',singleton_set) ).
cnf(non_ordered_pair1,axiom,
( ~ member(X1,non_ordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair1) ).
cnf(equal_ordered_pairs,hypothesis,
ordered_pair(a,c) = ordered_pair(b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_ordered_pairs) ).
cnf(non_ordered_pair2,axiom,
( X1 != X2
| ~ little_set(X1)
| member(X1,non_ordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair2) ).
cnf(non_ordered_pair4,axiom,
little_set(non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).
cnf(little_set_b,hypothesis,
little_set(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',little_set_b) ).
cnf(prove_first_components_equal,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_first_components_equal) ).
cnf(c_0_8,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_9,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_10,plain,
( ~ member(X1,non_ordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[non_ordered_pair1]) ).
cnf(c_0_11,hypothesis,
ordered_pair(a,c) = ordered_pair(b,d),
equal_ordered_pairs ).
cnf(c_0_12,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( X1 != X2
| ~ little_set(X1)
| member(X1,non_ordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[non_ordered_pair2]) ).
cnf(c_0_14,plain,
( ~ member(X1,non_ordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_10 ).
cnf(c_0_15,hypothesis,
non_ordered_pair(non_ordered_pair(b,b),non_ordered_pair(b,d)) = non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_16,plain,
( X1 != X2
| ~ little_set(X1)
| member(X1,non_ordered_pair(X2,X3)) ),
c_0_13 ).
cnf(c_0_17,hypothesis,
( ~ member(X1,non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,c)))
| X1 = non_ordered_pair(b,d)
| X1 = non_ordered_pair(b,b) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ little_set(X1)
| member(X1,non_ordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,axiom,
little_set(non_ordered_pair(X1,X2)),
non_ordered_pair4 ).
cnf(c_0_20,hypothesis,
( non_ordered_pair(b,b) = non_ordered_pair(a,a)
| non_ordered_pair(b,d) = non_ordered_pair(a,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,hypothesis,
little_set(b),
little_set_b ).
cnf(c_0_22,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_first_components_equal]) ).
cnf(c_0_23,hypothesis,
( member(b,non_ordered_pair(a,a))
| non_ordered_pair(b,b) = non_ordered_pair(a,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
a != b,
c_0_22 ).
cnf(c_0_25,hypothesis,
non_ordered_pair(b,b) = non_ordered_pair(a,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_24]) ).
cnf(c_0_26,hypothesis,
member(b,non_ordered_pair(a,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_25]),c_0_21])]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_26]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET016-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:47:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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.58/0.51 % Version: 3.5.1
% 0.58/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.58/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.58/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.58/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.58/0.51 % Starting sh5l with 300s (1) cores
% 0.58/0.51 % new_bool_3 with pid 1582469 completed with status 9
% 0.58/0.51 % new_bool_1 with pid 1582470 completed with status 9
% 0.58/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1582468 completed with status 0
% 0.58/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.58/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.58/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.58/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.58/0.51 % No SInE strategy applied
% 0.58/0.51 % Search class: FGHSF-FFLM31-MFFFFFNN
% 0.58/0.51 % partial match(1): FGHSM-FFLM31-MFFFFFNN
% 0.58/0.51 % Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.58/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.58/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.58/0.51 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.58/0.51 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.58/0.51 % Starting G-E--_200_B07_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.58/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1582476 completed with status 0
% 0.58/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.58/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.58/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.58/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.58/0.51 % No SInE strategy applied
% 0.58/0.51 % Search class: FGHSF-FFLM31-MFFFFFNN
% 0.58/0.51 % partial match(1): FGHSM-FFLM31-MFFFFFNN
% 0.58/0.51 % Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.58/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.58/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.58/0.51 % Preprocessing time : 0.003 s
% 0.58/0.51 % Presaturation interreduction done
% 0.58/0.51
% 0.58/0.51 % Proof found!
% 0.58/0.51 % SZS status Unsatisfiable
% 0.58/0.51 % SZS output start CNFRefutation
% See solution above
% 0.58/0.51 % Parsed axioms : 145
% 0.58/0.51 % Removed by relevancy pruning/SinE : 0
% 0.58/0.51 % Initial clauses : 145
% 0.58/0.51 % Removed in clause preprocessing : 6
% 0.58/0.51 % Initial clauses in saturation : 139
% 0.58/0.51 % Processed clauses : 566
% 0.58/0.51 % ...of these trivial : 3
% 0.58/0.51 % ...subsumed : 126
% 0.58/0.51 % ...remaining for further processing : 437
% 0.58/0.51 % Other redundant clauses eliminated : 14
% 0.58/0.51 % Clauses deleted for lack of memory : 0
% 0.58/0.51 % Backward-subsumed : 0
% 0.58/0.51 % Backward-rewritten : 18
% 0.58/0.51 % Generated clauses : 2263
% 0.58/0.51 % ...of the previous two non-redundant : 2146
% 0.58/0.51 % ...aggressively subsumed : 0
% 0.58/0.51 % Contextual simplify-reflections : 5
% 0.58/0.51 % Paramodulations : 2247
% 0.58/0.51 % Factorizations : 2
% 0.58/0.51 % NegExts : 0
% 0.58/0.51 % Equation resolutions : 14
% 0.58/0.51 % Disequality decompositions : 0
% 0.58/0.51 % Total rewrite steps : 414
% 0.58/0.51 % ...of those cached : 325
% 0.58/0.51 % Propositional unsat checks : 0
% 0.58/0.51 % Propositional check models : 0
% 0.58/0.51 % Propositional check unsatisfiable : 0
% 0.58/0.51 % Propositional clauses : 0
% 0.58/0.51 % Propositional clauses after purity: 0
% 0.58/0.51 % Propositional unsat core size : 0
% 0.58/0.51 % Propositional preprocessing time : 0.000
% 0.58/0.51 % Propositional encoding time : 0.000
% 0.58/0.51 % Propositional solver time : 0.000
% 0.58/0.51 % Success case prop preproc time : 0.000
% 0.58/0.51 % Success case prop encoding time : 0.000
% 0.58/0.51 % Success case prop solver time : 0.000
% 0.58/0.51 % Current number of processed clauses : 266
% 0.58/0.51 % Positive orientable unit clauses : 38
% 0.58/0.51 % Positive unorientable unit clauses: 0
% 0.58/0.51 % Negative unit clauses : 3
% 0.58/0.51 % Non-unit-clauses : 225
% 0.58/0.51 % Current number of unprocessed clauses: 1718
% 0.58/0.51 % ...number of literals in the above : 5140
% 0.58/0.51 % Current number of archived formulas : 0
% 0.58/0.51 % Current number of archived clauses : 163
% 0.58/0.51 % Clause-clause subsumption calls (NU) : 13944
% 0.58/0.51 % Rec. Clause-clause subsumption calls : 7461
% 0.58/0.51 % Non-unit clause-clause subsumptions : 62
% 0.58/0.52 % Unit Clause-clause subsumption calls : 767
% 0.58/0.52 % Rewrite failures with RHS unbound : 0
% 0.58/0.52 % BW rewrite match attempts : 18
% 0.58/0.52 % BW rewrite match successes : 13
% 0.58/0.52 % Condensation attempts : 0
% 0.58/0.52 % Condensation successes : 0
% 0.58/0.52 % Termbank termtop insertions : 34975
% 0.58/0.52 % Search garbage collected termcells : 316
% 0.58/0.52
% 0.58/0.52 % -------------------------------------------------
% 0.58/0.52 % User time : 0.069 s
% 0.58/0.52 % System time : 0.010 s
% 0.58/0.52 % Total time : 0.079 s
% 0.58/0.52 % Maximum resident set size: 3768 pages
% 0.58/0.52
% 0.58/0.52 % -------------------------------------------------
% 0.58/0.52 % User time : 0.350 s
% 0.58/0.52 % System time : 0.085 s
% 0.58/0.52 % Total time : 0.435 s
% 0.58/0.52 % Maximum resident set size: 4864 pages
% 0.58/0.52 % E exiting
%------------------------------------------------------------------------------