%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN356+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 : 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 : Thu Sep 24 09:10:09 AM UTC 2026
% Result : Theorem 0.09s 0.37s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 94 ( 35 ~; 28 |; 26 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 36 ( 1 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2107,conjecture,
( ( ! [U,V] :
( big_q(U,V)
=> big_q(U,U) )
& ! [X,Y] :
( big_r(X,Y)
=> ( big_q(X,Y)
& big_r(Y,X) ) )
& big_r(a,b) )
=> ( big_q(b,b)
& big_q(a,a) ) ),
file('theBenchmark.p',x2107) ).
fof(f_1_1,negated_conjecture,
( ~ ( big_q(b,b)
& big_q(a,a) )
& ! [U,V] :
( big_q(U,V)
=> big_q(U,U) )
& ! [X,Y] :
( big_r(X,Y)
=> ( big_q(X,Y)
& big_r(Y,X) ) )
& big_r(a,b) ),
inference(negate,[status(cth)],[x2107]) ).
fof(f_1_2,negated_conjecture,
( ( ~ big_q(b,b)
| ~ big_q(a,a) )
& ! [U,V] :
( big_q(U,U)
| ~ big_q(U,V) )
& ! [X,Y] :
( ( big_q(X,Y)
& big_r(Y,X) )
| ~ big_r(X,Y) )
& big_r(a,b) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ~ big_q(b,b)
| ~ big_q(a,a) )
& ! [U_3,U_2] :
( big_q(U_3,U_3)
| ~ big_q(U_3,U_2) )
& ! [U_1,U_0] :
( ( big_q(U_1,U_0)
& big_r(U_0,U_1) )
| ~ big_r(U_1,U_0) )
& big_r(a,b) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ~ big_q(b,b)
| ~ big_q(a,a) )
& ! [U_3] :
( ! [U_2] : ~ big_q(U_3,U_2)
| big_q(U_3,U_3) )
& ! [U_1,U_0] :
( ( big_q(U_1,U_0)
& big_r(U_0,U_1) )
| ~ big_r(U_1,U_0) )
& big_r(a,b) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_1,U_0] :
( big_q(U_1,U_0)
| ~ sP0(U_1,U_0) )
& ! [U_1,U_0] :
( big_r(U_0,U_1)
| ~ sP0(U_1,U_0) )
& ( ~ big_q(b,b)
| ~ big_q(a,a) )
& ! [U_2,U_3] :
( ~ big_q(U_3,U_2)
| big_q(U_3,U_3) )
& ! [U_1,U_0] :
( sP0(U_1,U_0)
| ~ big_r(U_1,U_0) )
& big_r(a,b) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_1_4]) ).
cnf(f_1_6,negated_conjecture,
big_r(a,b),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( sP0(U_1,U_0)
| ~ big_r(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,negated_conjecture,
( ~ big_q(U_3,U_2)
| big_q(U_3,U_3) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,negated_conjecture,
( ~ big_q(b,b)
| ~ big_q(a,a) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_10,negated_conjecture,
( big_r(U_0,U_1)
| ~ sP0(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_11,negated_conjecture,
( big_q(U_1,U_0)
| ~ sP0(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(t1,plain,
( ~ big_q(b,b)
| ~ big_q(a,a) ),
inference(start,[status(thm),parent(0:0)],[f_1_9]) ).
cnf(t2,plain,
( ~ big_q(a,b)
| big_q(a,a) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_8]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ sP0(a,b)
| big_q(a,b) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_11]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ big_r(a,b)
| sP0(a,b) ),
inference(extension,[status(thm),parent(t4:2)],[f_1_7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
big_r(a,b),
inference(extension,[status(thm),parent(t6:2)],[f_1_6]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ big_q(b,a)
| big_q(b,b) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_8]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t1:2]) ).
cnf(t12,plain,
( ~ sP0(b,a)
| big_q(b,a) ),
inference(extension,[status(thm),parent(t10:2)],[f_1_11]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( ~ big_r(b,a)
| sP0(b,a) ),
inference(extension,[status(thm),parent(t12:2)],[f_1_7]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( ~ sP0(a,b)
| big_r(b,a) ),
inference(extension,[status(thm),parent(t14:2)],[f_1_10]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
( ~ big_r(a,b)
| sP0(a,b) ),
inference(extension,[status(thm),parent(t16:2)],[f_1_7]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
big_r(a,b),
inference(extension,[status(thm),parent(t18:2)],[f_1_6]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN356+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.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 : Sun Sep 20 06:32:16 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % SZS status Theorem for theBenchmark
% 0.09/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------