%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN949+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 : 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:11:15 AM UTC 2026
% Result : Theorem 0.08s 0.38s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 115 ( 37 ~; 27 |; 45 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 68 ( 1 sgn 47 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [A,B,C] :
( ( ! [X,Y] :
( r(X,Y)
=> q(X,Y) )
& ! [X] :
( s(X)
=> p(X) )
& r(B,C)
& s(B)
& s(A) )
=> ? [X,Y] :
( q(X,Y)
& p(X) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ! [A,B,C] :
( ( ! [X,Y] :
( r(X,Y)
=> q(X,Y) )
& ! [X] :
( s(X)
=> p(X) )
& r(B,C)
& s(B)
& s(A) )
=> ? [X,Y] :
( q(X,Y)
& p(X) ) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
? [A,B,C] :
( ! [X,Y] :
( ~ q(X,Y)
| ~ p(X) )
& ! [X,Y] :
( q(X,Y)
| ~ r(X,Y) )
& ! [X] :
( p(X)
| ~ s(X) )
& r(B,C)
& s(B)
& s(A) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
? [U_7,U_6,U_5] :
( ! [U_4,U_3] :
( ~ q(U_4,U_3)
| ~ p(U_4) )
& ! [U_2,U_1] :
( q(U_2,U_1)
| ~ r(U_2,U_1) )
& ! [U_0] :
( p(U_0)
| ~ s(U_0) )
& r(U_6,U_5)
& s(U_6)
& s(U_7) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_7] : s(U_7)
& ? [U_6] :
( ? [U_5] : r(U_6,U_5)
& s(U_6) )
& ! [U_2,U_1] :
( q(U_2,U_1)
| ~ r(U_2,U_1) )
& ! [U_0] :
( p(U_0)
| ~ s(U_0) )
& ! [U_4] :
( ! [U_3] : ~ q(U_4,U_3)
| ~ p(U_4) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_7] : s(U_7)
& ? [U_5] : r(sK1,U_5)
& s(sK1)
& ! [U_2,U_1] :
( q(U_2,U_1)
| ~ r(U_2,U_1) )
& ! [U_0] :
( p(U_0)
| ~ s(U_0) )
& ! [U_4] :
( ! [U_3] : ~ q(U_4,U_3)
| ~ p(U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ? [U_7] : s(U_7)
& r(sK1,sK2)
& s(sK1)
& ! [U_2,U_1] :
( q(U_2,U_1)
| ~ r(U_2,U_1) )
& ! [U_0] :
( p(U_0)
| ~ s(U_0) )
& ! [U_4] :
( ! [U_3] : ~ q(U_4,U_3)
| ~ p(U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( s(sK3)
& r(sK1,sK2)
& s(sK1)
& ! [U_2,U_1] :
( q(U_2,U_1)
| ~ r(U_2,U_1) )
& ! [U_0] :
( p(U_0)
| ~ s(U_0) )
& ! [U_4] :
( ! [U_3] : ~ q(U_4,U_3)
| ~ p(U_4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_7,sK3)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( s(sK3)
& r(sK1,sK2)
& s(sK1)
& ! [U_1,U_2] :
( q(U_2,U_1)
| ~ r(U_2,U_1) )
& ! [U_0] :
( p(U_0)
| ~ s(U_0) )
& ! [U_3,U_4] :
( ~ q(U_4,U_3)
| ~ p(U_4) ) ),
inference(definitional_conversion,[status(esa)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
( ~ q(U_4,U_3)
| ~ p(U_4) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( p(U_0)
| ~ s(U_0) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_11,negated_conjecture,
( q(U_2,U_1)
| ~ r(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_12,negated_conjecture,
s(sK1),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_13,negated_conjecture,
r(sK1,sK2),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(t1,plain,
( ~ q(sK1,sK2)
| ~ p(sK1) ),
inference(start,[status(thm),parent(0:0)],[f_1_9]) ).
cnf(t2,plain,
( ~ s(sK1)
| p(sK1) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_10]) ).
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_12]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ r(sK1,sK2)
| q(sK1,sK2) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_11]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:2]) ).
cnf(t8,plain,
r(sK1,sK2),
inference(extension,[status(thm),parent(t6:2)],[f_1_13]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN949+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % 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.36 % Computer : n014.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 07:29:04 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.38 % SZS status Theorem for theBenchmark
% 0.08/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------