%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN361+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 : n012.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:10 AM UTC 2026
% Result : Theorem 0.02s 0.30s
% Output : Proof 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 65 ( 26 ~; 14 |; 20 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 49 ( 2 sgn 33 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2112,conjecture,
( ( ! [X,Y] :
( big_p(X,Y)
=> ~ big_q(X,Y) )
& ! [X] :
( big_s(X)
=> ? [Y] : big_q(Y,X) )
& ? [V] :
! [X] : big_p(X,V) )
=> ? [U] : ~ big_s(U) ),
file('theBenchmark.p',x2112) ).
fof(f_1_1,negated_conjecture,
( ~ ? [U] : ~ big_s(U)
& ! [X,Y] :
( big_p(X,Y)
=> ~ big_q(X,Y) )
& ! [X] :
( big_s(X)
=> ? [Y] : big_q(Y,X) )
& ? [V] :
! [X] : big_p(X,V) ),
inference(negate,[status(cth)],[x2112]) ).
fof(f_1_2,negated_conjecture,
( ! [U] : big_s(U)
& ! [X,Y] :
( ~ big_q(X,Y)
| ~ big_p(X,Y) )
& ! [X] :
( ? [Y] : big_q(Y,X)
| ~ big_s(X) )
& ? [V] :
! [X] : big_p(X,V) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ! [U_6] : big_s(U_6)
& ! [U_5,U_4] :
( ~ big_q(U_5,U_4)
| ~ big_p(U_5,U_4) )
& ! [U_3] :
( ? [U_2] : big_q(U_2,U_3)
| ~ big_s(U_3) )
& ? [U_1] :
! [U_0] : big_p(U_0,U_1) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ! [U_6] : big_s(U_6)
& ! [U_5,U_4] :
( ~ big_q(U_5,U_4)
| ~ big_p(U_5,U_4) )
& ! [U_3] :
( ? [U_2] : big_q(U_2,U_3)
| ~ big_s(U_3) )
& ! [U_0] : big_p(U_0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_6] : big_s(U_6)
& ! [U_5,U_4] :
( ~ big_q(U_5,U_4)
| ~ big_p(U_5,U_4) )
& ! [U_3] :
( big_q(sK2(U_3),U_3)
| ~ big_s(U_3) )
& ! [U_0] : big_p(U_0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2(U_3))],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_6] : big_s(U_6)
& ! [U_5,U_4] :
( ~ big_q(U_5,U_4)
| ~ big_p(U_5,U_4) )
& ! [U_3] :
( big_q(sK2(U_3),U_3)
| ~ big_s(U_3) )
& ! [U_0] : big_p(U_0,sK1) ),
inference(definitional_conversion,[status(esa)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
big_p(U_0,sK1),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( big_q(sK2(U_3),U_3)
| ~ big_s(U_3) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_9,negated_conjecture,
( ~ big_q(U_5,U_4)
| ~ big_p(U_5,U_4) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_10,negated_conjecture,
big_s(U_6),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(t1,plain,
( ~ big_q(sK2(sK1),sK1)
| ~ big_p(sK2(sK1),sK1) ),
inference(start,[status(thm),parent(0:0)],[f_1_9]) ).
cnf(t2,plain,
big_p(sK2(sK1),sK1),
inference(extension,[status(thm),parent(t1:1)],[f_1_7]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ big_s(sK1)
| big_q(sK2(sK1),sK1) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
big_s(sK1),
inference(extension,[status(thm),parent(t4:2)],[f_1_10]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN361+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Sun Sep 20 06:29:22 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.02/0.30 % SZS status Theorem for theBenchmark
% 0.02/0.30 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------