%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU149+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n002.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 : Fri Sep 25 02:51:06 PM UTC 2026
% Result : Theorem 27.51s 3.95s
% Output : Proof 27.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 11 unt; 0 def)
% Number of atoms : 87 ( 62 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 98 ( 37 ~; 33 |; 22 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 52 ( 1 sgn 33 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,conjecture,
! [A,B,C] :
( singleton(A) = unordered_pair(B,C)
=> A = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f6_neg,negated_conjecture,
~ ! [A,B,C] :
( singleton(A) = unordered_pair(B,C)
=> A = B ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f6_nnf,plain,
? [A,B,C] :
( A != B
& singleton(A) = unordered_pair(B,C) ),
inference(nnf_transformation,[status(thm)],[f6_neg]) ).
fof(f6_sk,plain,
( sk2 != sk3
& singleton(sk2) = unordered_pair(sk3,sk4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3,sk4])],[f6_nnf]) ).
cnf(c19,plain,
singleton(sk2) = unordered_pair(sk3,sk4),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
fof(f1,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f1_nnf,plain,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p22,plain,
unordered_pair(sk3,sk4) = singleton(sk2),
inference(superposition,[status(thm)],[c19,c1]) ).
fof(f3,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f3_nnf,plain,
! [A,B,C] :
( ( ? [D] :
( ( ( D = B
| D = A )
& ~ in(D,C) )
| ( D != B
& D != A
& in(D,C) ) )
| C = unordered_pair(A,B) )
& ( ! [D] :
( ( ( D != B
& D != A )
| in(D,C) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [C,A,B,D] :
( ( ( ( sk1(A,B,C) = B
| sk1(A,B,C) = A )
& ~ in(sk1(A,B,C),C) )
| ( sk1(A,B,C) != B
& sk1(A,B,C) != A
& in(sk1(A,B,C),C) )
| C = unordered_pair(A,B) )
& ( ( ( ( D != B
& D != A )
| in(D,C) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f3_nnf]) ).
cnf(c9,plain,
( X3 != X0
| in(X3,X2)
| X2 != unordered_pair(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p33,plain,
( X1 != sk3
| in(X1,X0)
| X0 != singleton(sk2) ),
inference(superposition,[status(thm)],[p22,c9]) ).
cnf(p42,plain,
( X0 != sk3
| in(X0,singleton(sk2)) ),
inference(equality_resolution,[status(thm)],[p33]) ).
cnf(p45,plain,
in(sk3,singleton(sk2)),
inference(equality_resolution,[status(thm)],[p42]) ).
fof(f2,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f2_nnf,plain,
! [A,B] :
( ( ? [C] :
( ( C = A
& ~ in(C,B) )
| ( C != A
& in(C,B) ) )
| B = singleton(A) )
& ( ! [C] :
( ( C != A
| in(C,B) )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [B,A,C] :
( ( ( sk0(A,B) = A
& ~ in(sk0(A,B),B) )
| ( sk0(A,B) != A
& in(sk0(A,B),B) )
| B = singleton(A) )
& ( ( ( C != A
| in(C,B) )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).
cnf(c2,plain,
( X2 = X0
| ~ in(X2,X1)
| X1 != singleton(X0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p23,plain,
( X0 = X1
| ~ in(X0,singleton(X1)) ),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(p48,plain,
sk3 = sk2,
inference(resolution,[status(thm)],[p45,p23]) ).
cnf(c20,plain,
sk2 != sk3,
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p49,plain,
sk2 != sk2,
inference(demodulation,[status(thm)],[p48,c20]) ).
cnf(p51,plain,
$false,
inference(equality_resolution,[status(thm)],[p49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU149+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 12:59:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 27.51/3.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.51/3.95 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------