%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN366+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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 : Thu Sep 24 09:10:11 AM UTC 2026
% Result : Theorem 0.13s 0.37s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 105 ( 37 ~; 28 |; 34 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 63 ( 2 sgn 50 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2117,conjecture,
( ( ! [W,Z] :
( big_r(W,W)
<=> big_r(Z,W) )
& ! [U,V] :
( big_r(U,U)
<=> big_r(U,V) ) )
=> ( ? [X] : big_r(X,X)
=> ! [Y] : big_r(Y,Y) ) ),
file('theBenchmark.p',x2117) ).
fof(f_1_1,negated_conjecture,
( ~ ! [Y] : big_r(Y,Y)
& ? [X] : big_r(X,X)
& ! [W,Z] :
( big_r(W,W)
<=> big_r(Z,W) )
& ! [U,V] :
( big_r(U,U)
<=> big_r(U,V) ) ),
inference(negate,[status(cth)],[x2117]) ).
fof(f_1_2,negated_conjecture,
( ? [Y] : ~ big_r(Y,Y)
& ? [X] : big_r(X,X)
& ! [W,Z] :
( ( big_r(W,W)
| ~ big_r(Z,W) )
& ( big_r(Z,W)
| ~ big_r(W,W) ) )
& ! [U,V] :
( ( big_r(U,U)
| ~ big_r(U,V) )
& ( big_r(U,V)
| ~ big_r(U,U) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ? [U_5] : ~ big_r(U_5,U_5)
& ? [U_4] : big_r(U_4,U_4)
& ! [U_3,U_2] :
( ( big_r(U_3,U_3)
| ~ big_r(U_2,U_3) )
& ( big_r(U_2,U_3)
| ~ big_r(U_3,U_3) ) )
& ! [U_1,U_0] :
( ( big_r(U_1,U_1)
| ~ big_r(U_1,U_0) )
& ( big_r(U_1,U_0)
| ~ big_r(U_1,U_1) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_5] : ~ big_r(U_5,U_5)
& ? [U_4] : big_r(U_4,U_4)
& ! [U_13] :
( ! [U_11] : ~ big_r(U_11,U_13)
| big_r(U_13,U_13) )
& ! [U_12] :
( ! [U_10] : big_r(U_10,U_12)
| ~ big_r(U_12,U_12) )
& ! [U_9] :
( ! [U_7] : ~ big_r(U_9,U_7)
| big_r(U_9,U_9) )
& ! [U_8] :
( ! [U_6] : big_r(U_8,U_6)
| ~ big_r(U_8,U_8) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_5] : ~ big_r(U_5,U_5)
& big_r(sK1,sK1)
& ! [U_13] :
( ! [U_11] : ~ big_r(U_11,U_13)
| big_r(U_13,U_13) )
& ! [U_12] :
( ! [U_10] : big_r(U_10,U_12)
| ~ big_r(U_12,U_12) )
& ! [U_9] :
( ! [U_7] : ~ big_r(U_9,U_7)
| big_r(U_9,U_9) )
& ! [U_8] :
( ! [U_6] : big_r(U_8,U_6)
| ~ big_r(U_8,U_8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_4,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ~ big_r(sK2,sK2)
& big_r(sK1,sK1)
& ! [U_13] :
( ! [U_11] : ~ big_r(U_11,U_13)
| big_r(U_13,U_13) )
& ! [U_12] :
( ! [U_10] : big_r(U_10,U_12)
| ~ big_r(U_12,U_12) )
& ! [U_9] :
( ! [U_7] : ~ big_r(U_9,U_7)
| big_r(U_9,U_9) )
& ! [U_8] :
( ! [U_6] : big_r(U_8,U_6)
| ~ big_r(U_8,U_8) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ~ big_r(sK2,sK2)
& big_r(sK1,sK1)
& ! [U_11,U_13] :
( ~ big_r(U_11,U_13)
| big_r(U_13,U_13) )
& ! [U_12,U_10] :
( big_r(U_10,U_12)
| ~ big_r(U_12,U_12) )
& ! [U_9,U_7] :
( ~ big_r(U_9,U_7)
| big_r(U_9,U_9) )
& ! [U_8,U_6] :
( big_r(U_8,U_6)
| ~ big_r(U_8,U_8) ) ),
inference(definitional_conversion,[status(esa)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( big_r(U_8,U_6)
| ~ big_r(U_8,U_8) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_11,negated_conjecture,
( ~ big_r(U_11,U_13)
| big_r(U_13,U_13) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_12,negated_conjecture,
big_r(sK1,sK1),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_13,negated_conjecture,
~ big_r(sK2,sK2),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
~ big_r(sK2,sK2),
inference(start,[status(thm),parent(0:0)],[f_1_13]) ).
cnf(t2,plain,
( ~ big_r(sK1,sK2)
| big_r(sK2,sK2) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_11]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ big_r(sK1,sK1)
| big_r(sK1,sK2) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
big_r(sK1,sK1),
inference(extension,[status(thm),parent(t4:2)],[f_1_12]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN366+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 06:29:51 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------