%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET017-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n009.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:52 PM UTC 2026
% Result : Unsatisfiable 1.32s 1.74s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 18 unt; 2 nHn; 22 RR)
% Number of literals : 42 ( 16 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
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(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(prove_left_cancellation_2,negated_conjecture,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_2) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(prove_left_cancellation_1,negated_conjecture,
unordered_pair(x,y) = unordered_pair(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(prove_left_cancellation_3,negated_conjecture,
y != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_left_cancellation_3) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
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,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product1 ).
cnf(c_0_12,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_13,negated_conjecture,
member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
prove_left_cancellation_2 ).
cnf(c_0_14,plain,
( member(X1,X3)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
member(unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),cross_product(universal_class,universal_class)),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_17,negated_conjecture,
unordered_pair(x,y) = unordered_pair(x,z),
prove_left_cancellation_1 ).
cnf(c_0_18,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_20,negated_conjecture,
member(y,unordered_pair(x,z)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
y != z,
prove_left_cancellation_3 ).
cnf(c_0_22,negated_conjecture,
x = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_24,negated_conjecture,
unordered_pair(y,y) = unordered_pair(y,z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_22]),c_0_22]) ).
cnf(c_0_25,plain,
( member(X2,X4)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4)) ),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( X1 = y
| ~ member(X1,unordered_pair(y,z)) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
member(z,universal_class),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_27])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET017-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n009.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:04:26 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.32/1.74 % Version : CSE_E---1.7
% 1.32/1.74 % Problem : theBenchmark.p
% 1.32/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.74 % SZS output start CNFRefutation
% See solution above
% 1.32/1.74 % Total time : 1.372s
%------------------------------------------------------------------------------