%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET016-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:06:51 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 17 unt; 4 nHn; 18 RR)
% Number of literals : 34 ( 21 equ; 8 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 : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(equal_ordered_pairs,hypothesis,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_ordered_pairs) ).
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = unordered_pair(singleton_set(X1),unordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair) ).
cnf(unordered_pair_1,axiom,
member(X1,unordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_1) ).
cnf(unordered_pair_3,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_3) ).
cnf(singleton_2,axiom,
( X1 = X2
| ~ member(X1,singleton_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_2) ).
cnf(singleton_1,axiom,
member(X1,singleton_set(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_1) ).
cnf(prove_first_components_equal,negated_conjecture,
m1 != m2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_first_components_equal) ).
cnf(c_0_7,hypothesis,
ordered_pair(m1,r1) = ordered_pair(m2,r2),
equal_ordered_pairs ).
cnf(c_0_8,axiom,
ordered_pair(X1,X2) = unordered_pair(singleton_set(X1),unordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_9,axiom,
member(X1,unordered_pair(X1,X2)),
unordered_pair_1 ).
cnf(c_0_10,hypothesis,
unordered_pair(singleton_set(m2),unordered_pair(m2,r2)) = unordered_pair(singleton_set(m1),unordered_pair(m1,r1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_3 ).
cnf(c_0_12,hypothesis,
member(singleton_set(m1),unordered_pair(singleton_set(m2),unordered_pair(m2,r2))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( X1 = X2
| ~ member(X1,singleton_set(X2)) ),
singleton_2 ).
cnf(c_0_14,hypothesis,
( singleton_set(m1) = unordered_pair(m2,r2)
| singleton_set(m1) = singleton_set(m2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
( singleton_set(m1) = unordered_pair(m2,r2)
| X1 = m1
| ~ member(X1,singleton_set(m2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
member(X1,singleton_set(X1)),
singleton_1 ).
cnf(c_0_17,negated_conjecture,
m1 != m2,
prove_first_components_equal ).
cnf(c_0_18,hypothesis,
singleton_set(m1) = unordered_pair(m2,r2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,hypothesis,
member(m1,unordered_pair(m2,r2)),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_20,hypothesis,
r2 = m1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_17]) ).
cnf(c_0_21,hypothesis,
singleton_set(m1) = unordered_pair(m2,m1),
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_22,hypothesis,
( X1 = m1
| ~ member(X1,unordered_pair(m2,m1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_9]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET016-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34 % Computer : n001.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 02:06:18 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------