%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN730+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:58 AM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 25 ( 9 ~; 9 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 23 ( 1 sgn 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm75,conjecture,
? [V] :
! [J] :
? [Q] :
( ( p(V,J,k(J))
| p(a,J,h(J)) )
=> p(V,J,Q) ),
file('theBenchmark.p',thm75) ).
fof(f_1_1,negated_conjecture,
~ ? [V] :
! [J] :
? [Q] :
( ( p(V,J,k(J))
| p(a,J,h(J)) )
=> p(V,J,Q) ),
inference(negate,[status(cth)],[thm75]) ).
fof(f_1_2,negated_conjecture,
! [V] :
? [J] :
! [Q] :
( ~ p(V,J,Q)
& ( p(V,J,k(J))
| p(a,J,h(J)) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
! [U_2] :
? [U_1] :
! [U_0] :
( ~ p(U_2,U_1,U_0)
& ( p(U_2,U_1,k(U_1))
| p(a,U_1,h(U_1)) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
! [U_2] :
? [U_1] :
( ! [U_0] : ~ p(U_2,U_1,U_0)
& ( p(U_2,U_1,k(U_1))
| p(a,U_1,h(U_1)) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
! [U_2] :
( ! [U_0] : ~ p(U_2,sK1(U_2),U_0)
& ( p(U_2,sK1(U_2),k(sK1(U_2)))
| p(a,sK1(U_2),h(sK1(U_2))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1(U_2))],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_0,U_2] : ~ p(U_2,sK1(U_2),U_0)
& ! [U_2] :
( p(U_2,sK1(U_2),k(sK1(U_2)))
| p(a,sK1(U_2),h(sK1(U_2))) ) ),
inference(definitional_conversion,[status(esa)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( p(U_2,sK1(U_2),k(sK1(U_2)))
| p(a,sK1(U_2),h(sK1(U_2))) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
~ p(U_2,sK1(U_2),U_0),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(t1,plain,
~ p(a,sK1(a),k(sK1(a))),
inference(start,[status(thm),parent(0:0)],[f_1_8]) ).
cnf(t2,plain,
( p(a,sK1(a),h(sK1(a)))
| p(a,sK1(a),k(sK1(a))) ),
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,
~ p(a,sK1(a),h(sK1(a))),
inference(extension,[status(thm),parent(t2:2)],[f_1_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN730+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.09/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 07:08:24 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------