%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN074+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n007.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 03:33:43 PM UTC 2026
% Result : Theorem 3.32s 0.86s
% Output : Proof 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 74 ( 46 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 80 ( 30 ~; 30 |; 15 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 2 sgn 16 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
? [Z] :
! [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<=> X = Z ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel51) ).
fof(f1_neg,negated_conjecture,
~ ? [Z] :
! [X] :
( ? [W] :
! [Y] :
( big_f(X,Y)
<=> Y = W )
<=> X = Z ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f1_nnf,plain,
! [Z] :
? [X] :
( ( X = Z
& ! [W] :
? [Y] :
( ( Y = W
& ~ big_f(X,Y) )
| ( Y != W
& big_f(X,Y) ) ) )
| ( X != Z
& ? [W] :
! [Y] :
( ( Y != W
| big_f(X,Y) )
& ( Y = W
| ~ big_f(X,Y) ) ) ) ),
inference(nnf_transformation,[status(thm)],[f1_neg]) ).
fof(f1_sk,plain,
! [Z,Y,W] :
( ( sk2(Z) = Z
& ( ( sk4(Z,W) = W
& ~ big_f(sk2(Z),sk4(Z,W)) )
| ( sk4(Z,W) != W
& big_f(sk2(Z),sk4(Z,W)) ) ) )
| ( sk2(Z) != Z
& ( Y != sk3(Z)
| big_f(sk2(Z),Y) )
& ( Y = sk3(Z)
| ~ big_f(sk2(Z),Y) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3,sk4])],[f1_nnf]) ).
cnf(c15,plain,
( ~ big_f(sk2(X0),sk4(X0,X2))
| sk4(X0,X2) != X2
| sk2(X0) != X0 ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(c12,plain,
( sk2(X0) = X0
| X3 != sk3(X0)
| big_f(sk2(X0),X3) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p23,plain,
( sk2(X0) = X0
| big_f(sk2(X0),sk3(X0)) ),
inference(equality_resolution,[status(thm)],[c12]) ).
fof(f0,axiom,
? [Z,W] :
! [X,Y] :
( big_f(X,Y)
<=> ( Y = W
& X = Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel51_1) ).
fof(f0_nnf,plain,
? [Z,W] :
! [X,Y] :
( ( Y != W
| X != Z
| big_f(X,Y) )
& ( ( Y = W
& X = Z )
| ~ big_f(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( ( Y != sk1
| X != sk0
| big_f(X,Y) )
& ( ( Y = sk1
& X = sk0 )
| ~ big_f(X,Y) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c0,plain,
( X2 = sk0
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p24,plain,
( sk2(X0) = sk0
| sk2(X0) = X0 ),
inference(resolution,[status(thm)],[p23,c0]) ).
cnf(p26,plain,
sk2(sk0) = sk0,
inference(factoring,[status(thm)],[p24]) ).
cnf(p212,plain,
( ~ big_f(sk0,sk4(sk0,X0))
| sk4(sk0,X0) != X0 ),
inference(resolution,[status(thm)],[c15,p26]) ).
cnf(c14,plain,
( sk4(X0,X2) = X2
| big_f(sk2(X0),sk4(X0,X2))
| sk2(X0) != X0 ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p169,plain,
( sk4(sk0,X0) = X0
| big_f(sk0,sk4(sk0,X0)) ),
inference(resolution,[status(thm)],[c14,p26]) ).
cnf(c1,plain,
( X3 = sk1
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p181,plain,
( sk4(sk0,X0) = sk1
| sk4(sk0,X0) = X0 ),
inference(resolution,[status(thm)],[p169,c1]) ).
cnf(p191,plain,
sk4(sk0,sk1) = sk1,
inference(factoring,[status(thm)],[p181]) ).
cnf(p225,plain,
~ big_f(sk0,sk1),
inference(resolution,[status(thm)],[p212,p191]) ).
cnf(c2,plain,
( X3 != sk1
| X2 != sk0
| big_f(X2,X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p18,plain,
( X0 != sk1
| big_f(sk0,X0) ),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(p20,plain,
big_f(sk0,sk1),
inference(equality_resolution,[status(thm)],[p18]) ).
cnf(p226,plain,
$false,
inference(resolution,[status(thm)],[p225,p20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN074+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.37 % Computer : n007.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 00:02:39 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.32/0.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/0.86 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------