%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN979+1 : TPTP v9.3.1. Released v3.1.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 : n011.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:11:19 AM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 119 ( 29 ~; 20 |; 62 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 37 ( 2 sgn 24 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [A,B] :
? [X,Y] :
( ( s(A)
& ( s(A)
=> p(X,Y) )
& r(B)
& r(A)
& ( r(Y)
=> p(B,Y) )
& q(B)
& q(A)
& ( q(X)
=> p(X,A) ) )
=> p(A,B) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ! [A,B] :
? [X,Y] :
( ( s(A)
& ( s(A)
=> p(X,Y) )
& r(B)
& r(A)
& ( r(Y)
=> p(B,Y) )
& q(B)
& q(A)
& ( q(X)
=> p(X,A) ) )
=> p(A,B) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
? [A,B] :
! [X,Y] :
( ~ p(A,B)
& s(A)
& ( p(X,Y)
| ~ s(A) )
& r(B)
& r(A)
& ( p(B,Y)
| ~ r(Y) )
& q(B)
& q(A)
& ( p(X,A)
| ~ q(X) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
? [U_3,U_2] :
! [U_1,U_0] :
( ~ p(U_3,U_2)
& s(U_3)
& ( p(U_1,U_0)
| ~ s(U_3) )
& r(U_2)
& r(U_3)
& ( p(U_2,U_0)
| ~ r(U_0) )
& q(U_2)
& q(U_3)
& ( p(U_1,U_3)
| ~ q(U_1) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
? [U_3,U_2] :
( ( ! [U_7,U_5] : p(U_7,U_5)
| ~ s(U_3) )
& ! [U_4] :
( p(U_2,U_4)
| ~ r(U_4) )
& ! [U_6] :
( p(U_6,U_3)
| ~ q(U_6) )
& s(U_3)
& r(U_2)
& r(U_3)
& q(U_2)
& q(U_3)
& ~ p(U_3,U_2) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
? [U_2] :
( ( ! [U_7,U_5] : p(U_7,U_5)
| ~ s(sK1) )
& ! [U_4] :
( p(U_2,U_4)
| ~ r(U_4) )
& ! [U_6] :
( p(U_6,sK1)
| ~ q(U_6) )
& s(sK1)
& r(U_2)
& r(sK1)
& q(U_2)
& q(sK1)
& ~ p(sK1,U_2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ! [U_7,U_5] : p(U_7,U_5)
| ~ s(sK1) )
& ! [U_4] :
( p(sK2,U_4)
| ~ r(U_4) )
& ! [U_6] :
( p(U_6,sK1)
| ~ q(U_6) )
& s(sK1)
& r(sK2)
& r(sK1)
& q(sK2)
& q(sK1)
& ~ p(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_7,U_5] :
( p(U_7,U_5)
| ~ s(sK1) )
& ! [U_4] :
( p(sK2,U_4)
| ~ r(U_4) )
& ! [U_6] :
( p(U_6,sK1)
| ~ q(U_6) )
& s(sK1)
& r(sK2)
& r(sK1)
& q(sK2)
& q(sK1)
& ~ p(sK1,sK2) ),
inference(definitional_conversion,[status(esa)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
~ p(sK1,sK2),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_13,negated_conjecture,
s(sK1),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_16,negated_conjecture,
( p(U_7,U_5)
| ~ s(sK1) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
~ p(sK1,sK2),
inference(start,[status(thm),parent(0:0)],[f_1_8]) ).
cnf(t2,plain,
( ~ s(sK1)
| p(sK1,sK2) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_16]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
s(sK1),
inference(extension,[status(thm),parent(t2:2)],[f_1_13]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN979+1 : TPTP v9.3.1. Released v3.1.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.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 07:29:24 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------