%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SEU189+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 02:51:16 PM UTC 2026
% Result : Theorem 26.91s 4.07s
% Output : Proof 26.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 59 ( 48 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 57 ( 22 ~; 18 |; 11 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn 5 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f24,axiom,
! [A] :
( relation(A)
=> ( ( relation_rng(A) = empty_set
| relation_dom(A) = empty_set )
=> A = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t64_relat_1) ).
fof(f24_nnf,plain,
! [A] :
( A = empty_set
| ( relation_rng(A) != empty_set
& relation_dom(A) != empty_set )
| ~ relation(A) ),
inference(nnf_transformation,[status(thm)],[f24]) ).
fof(f24_sk,plain,
! [A] :
( A = empty_set
| ( relation_rng(A) != empty_set
& relation_dom(A) != empty_set )
| ~ relation(A) ),
inference(skolemisation,[status(esa)],[f24_nnf]) ).
cnf(c35,plain,
( X0 = empty_set
| relation_rng(X0) != empty_set
| ~ relation(X0) ),
inference(cnf_transformation,[status(esa)],[f24_sk]) ).
fof(f22,conjecture,
! [A] :
( relation(A)
=> ( relation_dom(A) = empty_set
<=> relation_rng(A) = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t65_relat_1) ).
fof(f22_neg,negated_conjecture,
~ ! [A] :
( relation(A)
=> ( relation_dom(A) = empty_set
<=> relation_rng(A) = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f22_nnf,plain,
? [A] :
( ( ( relation_rng(A) = empty_set
& relation_dom(A) != empty_set )
| ( relation_rng(A) != empty_set
& relation_dom(A) = empty_set ) )
& relation(A) ),
inference(nnf_transformation,[status(thm)],[f22_neg]) ).
fof(f22_sk,plain,
( ( ( relation_rng(sk5) = empty_set
& relation_dom(sk5) != empty_set )
| ( relation_rng(sk5) != empty_set
& relation_dom(sk5) = empty_set ) )
& relation(sk5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk5])],[f22_nnf]) ).
cnf(c27,plain,
relation(sk5),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
cnf(p63,plain,
( sk5 = empty_set
| relation_rng(sk5) != empty_set ),
inference(resolution,[status(thm)],[c35,c27]) ).
cnf(c29,plain,
( relation_rng(sk5) = empty_set
| relation_dom(sk5) = empty_set ),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
cnf(p66,plain,
( relation_dom(sk5) = empty_set
| sk5 = empty_set ),
inference(resolution,[status(thm)],[p63,c29]) ).
cnf(c34,plain,
( X0 = empty_set
| relation_dom(X0) != empty_set
| ~ relation(X0) ),
inference(cnf_transformation,[status(esa)],[f24_sk]) ).
cnf(p61,plain,
( sk5 = empty_set
| relation_dom(sk5) != empty_set ),
inference(resolution,[status(thm)],[c34,c27]) ).
cnf(p69,plain,
( sk5 = empty_set
| sk5 = empty_set ),
inference(resolution,[status(thm)],[p66,p61]) ).
cnf(p72,plain,
sk5 = empty_set,
inference(factoring,[status(thm)],[p69]) ).
cnf(c30,plain,
( relation_dom(sk5) != empty_set
| relation_rng(sk5) != empty_set ),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
cnf(p73,plain,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
inference(demodulation,[status(thm)],[p72,c30]) ).
fof(f23,axiom,
( relation_rng(empty_set) = empty_set
& relation_dom(empty_set) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_relat_1) ).
fof(f23_nnf,plain,
( relation_rng(empty_set) = empty_set
& relation_dom(empty_set) = empty_set ),
inference(nnf_transformation,[status(thm)],[f23]) ).
fof(f23_sk,plain,
( relation_rng(empty_set) = empty_set
& relation_dom(empty_set) = empty_set ),
inference(skolemisation,[status(esa)],[f23_nnf]) ).
cnf(c33,plain,
relation_rng(empty_set) = empty_set,
inference(cnf_transformation,[status(esa)],[f23_sk]) ).
cnf(p74,plain,
empty_set != empty_set,
inference(resolution,[status(thm)],[p73,c33]) ).
cnf(p75,plain,
$false,
inference(equality_resolution,[status(thm)],[p74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU189+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n018.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 13:08:48 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 26.91/4.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.91/4.07 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------