%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN371+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/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 03:34:31 PM UTC 2026
% Result : Theorem 2.30s 0.78s
% Output : Proof 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 23 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 8 ~; 2 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ( ? [X] : big_r(X,X)
=> ! [Y] : big_r(Y,Y) )
=> ? [U] :
! [V] :
( big_r(U,U)
=> big_r(V,V) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2122) ).
fof(f0_neg,negated_conjecture,
~ ( ( ? [X] : big_r(X,X)
=> ! [Y] : big_r(Y,Y) )
=> ? [U] :
! [V] :
( big_r(U,U)
=> big_r(V,V) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ! [U] :
? [V] :
( ~ big_r(V,V)
& big_r(U,U) )
& ( ! [Y] : big_r(Y,Y)
| ! [X] : ~ big_r(X,X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y,U] :
( ~ big_r(sk0(U),sk0(U))
& big_r(U,U)
& ( big_r(Y,Y)
| ~ big_r(X,X) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c1,plain,
big_r(X2,X2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
big_r(X1,X1) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t4,plain,
big_r(X1,X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c2,plain,
~ big_r(sk0(X2),sk0(X2)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
big_r(sk0(X1),sk0(X1)) != true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t4]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN371+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n002.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 01:03:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.30/0.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.30/0.78 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------