%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET016-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:05 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 18 unt; 6 nHn; 21 RR)
% Number of literals : 42 ( 25 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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 : 31 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_3,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_3) ).
cnf(unordered_pair_1,axiom,
member(X1,unordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_1) ).
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = unordered_pair(singleton_set(X1),unordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).
cnf(equal_ordered_pairs,hypothesis,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pairs) ).
cnf(singleton_2,axiom,
( ~ member(X1,singleton_set(X2))
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_2) ).
cnf(singleton_1,axiom,
member(X1,singleton_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_1) ).
cnf(prove_first_components_equal,negated_conjecture,
m1 != m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_first_components_equal) ).
cnf(c_0_7,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_3]) ).
cnf(c_0_8,axiom,
member(X1,unordered_pair(X1,X2)),
unordered_pair_1 ).
cnf(c_0_9,axiom,
ordered_pair(X1,X2) = unordered_pair(singleton_set(X1),unordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_10,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_7 ).
cnf(c_0_11,plain,
member(singleton_set(X1),ordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
equal_ordered_pairs ).
cnf(c_0_13,plain,
( ~ member(X1,ordered_pair(X2,X3))
| X1 = singleton_set(X2)
| X1 = unordered_pair(X2,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,hypothesis,
member(singleton_set(m1),ordered_pair(m2,r2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ member(X1,singleton_set(X2))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[singleton_2]) ).
cnf(c_0_16,axiom,
member(X1,singleton_set(X1)),
singleton_1 ).
cnf(c_0_17,hypothesis,
( singleton_set(m1) = singleton_set(m2)
| singleton_set(m1) = unordered_pair(m2,r2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
m1 != m2,
inference(fof_simplification,[status(thm)],[prove_first_components_equal]) ).
cnf(c_0_19,plain,
( ~ member(X1,singleton_set(X2))
| X1 = X2 ),
c_0_15 ).
cnf(c_0_20,hypothesis,
( member(m1,singleton_set(m2))
| singleton_set(m1) = unordered_pair(m2,r2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
m1 != m2,
c_0_18 ).
cnf(c_0_22,hypothesis,
singleton_set(m1) = unordered_pair(m2,r2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,hypothesis,
member(m1,unordered_pair(m2,r2)),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_24,hypothesis,
r2 = m1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_21]) ).
cnf(c_0_25,hypothesis,
singleton_set(m1) = unordered_pair(m2,m1),
inference(rw,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_26,hypothesis,
( ~ member(X1,unordered_pair(m2,m1))
| X1 = m1 ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_8]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET016-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n018.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 04:44:43 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % new_bool_3 with pid 983952 completed with status 0
% 0.14/0.41 % Result found by new_bool_3
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FGUSM-FFSF21-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % SubtermCWHack with pid 983955 completed with status 0
% 0.14/0.41 % Result found by SubtermCWHack
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FGUSM-FFSF21-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 8
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 8
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 8
% 0.14/0.41 % Processed clauses : 28
% 0.14/0.41 % ...of these trivial : 1
% 0.14/0.41 % ...subsumed : 0
% 0.14/0.41 % ...remaining for further processing : 27
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 0
% 0.14/0.41 % Backward-rewritten : 5
% 0.14/0.41 % Generated clauses : 63
% 0.14/0.41 % ...of the previous two non-redundant : 52
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 62
% 0.14/0.41 % Factorizations : 1
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 39
% 0.14/0.41 % ...of those cached : 25
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 22
% 0.14/0.41 % Positive orientable unit clauses : 17
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 1
% 0.14/0.41 % Non-unit-clauses : 4
% 0.14/0.41 % Current number of unprocessed clauses: 30
% 0.14/0.41 % ...number of literals in the above : 46
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 5
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 2
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 2
% 0.14/0.41 % Non-unit clause-clause subsumptions : 0
% 0.14/0.41 % Unit Clause-clause subsumption calls : 0
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 3
% 0.14/0.41 % BW rewrite match successes : 2
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 871
% 0.14/0.41 % Search garbage collected termcells : 8
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.004 s
% 0.14/0.41 % System time : 0.001 s
% 0.14/0.41 % Total time : 0.005 s
% 0.14/0.41 % Maximum resident set size: 3888 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.005 s
% 0.14/0.41 % System time : 0.005 s
% 0.14/0.41 % Total time : 0.011 s
% 0.14/0.41 % Maximum resident set size: 4864 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------