%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN722+1 : TPTP v9.3.1. Released v2.5.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 : n008.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:57 AM UTC 2026
% Result : Theorem 0.08s 0.39s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 19 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 121 ( 53 ~; 50 |; 18 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 21 ( 1 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm119,conjecture,
~ ( ( ~ p(b)
| ~ p(a) )
& ! [X] :
? [Y] :
( ~ q(d)
| ~ q(c)
| ~ q(Y)
| ~ q(X)
| p(X) )
& ! [Z] :
( q(Z)
& ( r(Z)
| p(Z) ) ) ),
file('theBenchmark.p',thm119) ).
fof(f_1_1,negated_conjecture,
( ( ~ p(b)
| ~ p(a) )
& ! [X] :
? [Y] :
( ~ q(d)
| ~ q(c)
| ~ q(Y)
| ~ q(X)
| p(X) )
& ! [Z] :
( q(Z)
& ( r(Z)
| p(Z) ) ) ),
inference(negate,[status(cth)],[thm119]) ).
fof(f_1_2,negated_conjecture,
( ( ~ p(b)
| ~ p(a) )
& ! [U_2] :
? [U_1] :
( ~ q(d)
| ~ q(c)
| ~ q(U_1)
| ~ q(U_2)
| p(U_2) )
& ! [U_0] :
( q(U_0)
& ( r(U_0)
| p(U_0) ) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ~ p(b)
| ~ p(a) )
& ( ! [U_2] :
( ~ q(U_2)
| p(U_2) )
| ? [U_1] : ~ q(U_1)
| ~ q(d)
| ~ q(c) )
& ! [U_4] : q(U_4)
& ! [U_3] :
( r(U_3)
| p(U_3) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ~ p(b)
| ~ p(a) )
& ( ! [U_2] :
( ~ q(U_2)
| p(U_2) )
| ~ q(sK1)
| ~ q(d)
| ~ q(c) )
& ! [U_4] : q(U_4)
& ! [U_3] :
( r(U_3)
| p(U_3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ~ p(b)
| ~ p(a) )
& ! [U_2] :
( ~ q(U_2)
| p(U_2)
| ~ q(sK1)
| ~ q(d)
| ~ q(c) )
& ! [U_4] : q(U_4)
& ! [U_3] :
( r(U_3)
| p(U_3) ) ),
inference(definitional_conversion,[status(esa)],[f_1_4]) ).
cnf(f_1_7,negated_conjecture,
q(U_4),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,negated_conjecture,
( ~ q(U_2)
| p(U_2)
| ~ q(sK1)
| ~ q(d)
| ~ q(c) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,negated_conjecture,
( ~ p(b)
| ~ p(a) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(t1,plain,
( ~ p(b)
| ~ p(a) ),
inference(start,[status(thm),parent(0:0)],[f_1_9]) ).
cnf(t2,plain,
( ~ q(d)
| ~ q(sK1)
| ~ q(a)
| ~ q(c)
| p(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,
q(c),
inference(extension,[status(thm),parent(t2:2)],[f_1_7]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
q(a),
inference(extension,[status(thm),parent(t2:3)],[f_1_7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
q(sK1),
inference(extension,[status(thm),parent(t2:4)],[f_1_7]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
cnf(t10,plain,
q(d),
inference(extension,[status(thm),parent(t2:5)],[f_1_7]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:5]) ).
cnf(t12,plain,
( ~ q(d)
| ~ q(sK1)
| ~ q(b)
| ~ q(c)
| p(b) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_8]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t1:2]) ).
cnf(t14,plain,
q(c),
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,
q(b),
inference(extension,[status(thm),parent(t12:3)],[f_1_7]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
q(sK1),
inference(extension,[status(thm),parent(t12:4)],[f_1_7]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t12:4]) ).
cnf(t20,plain,
q(d),
inference(extension,[status(thm),parent(t12:5)],[f_1_7]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t12:5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN722+1 : TPTP v9.3.1. Released v2.5.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 : n008.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:08:10 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.39 % SZS status Theorem for theBenchmark
% 0.08/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------