%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN065+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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:09:22 AM UTC 2026
% Result : Theorem 0.09s 5.39s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 18 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 10 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 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 : 31 ( 1 sgn 19 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel36_2,axiom,
! [X] :
? [Y] : big_g(X,Y),
file('theBenchmark.p',pel36_2) ).
fof(pel36_3,axiom,
! [X,Y] :
( ( big_g(X,Y)
| big_f(X,Y) )
=> ! [Z] :
( ( big_g(Y,Z)
| big_f(Y,Z) )
=> big_h(X,Z) ) ),
file('theBenchmark.p',pel36_3) ).
fof(pel36,conjecture,
! [X] :
? [Y] : big_h(X,Y),
file('theBenchmark.p',pel36) ).
fof(f_2_1,plain,
! [X] :
? [Y] : big_g(X,Y),
inference(fof_nnf,[status(thm)],[pel36_2]) ).
fof(f_2_2,plain,
! [U_3] :
? [U_2] : big_g(U_3,U_2),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
! [U_3] : big_g(U_3,sK2(U_3)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2(U_3))],[f_2_2]) ).
cnf(f_2_4,plain,
big_g(U_3,sK2(U_3)),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X,Y] :
( ! [Z] :
( big_h(X,Z)
| ( ~ big_g(Y,Z)
& ~ big_f(Y,Z) ) )
| ( ~ big_g(X,Y)
& ~ big_f(X,Y) ) ),
inference(fof_nnf,[status(thm)],[pel36_3]) ).
fof(f_3_2,plain,
! [U_6,U_5] :
( ! [U_4] :
( big_h(U_6,U_4)
| ( ~ big_g(U_5,U_4)
& ~ big_f(U_5,U_4) ) )
| ( ~ big_g(U_6,U_5)
& ~ big_f(U_6,U_5) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_6,plain,
( ~ big_g(U_5,U_4)
| big_h(U_6,U_4)
| ~ big_g(U_6,U_5) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,negated_conjecture,
~ ! [X] :
? [Y] : big_h(X,Y),
inference(negate,[status(cth)],[pel36]) ).
fof(f_4_2,negated_conjecture,
? [X] :
! [Y] : ~ big_h(X,Y),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
? [U_8] :
! [U_7] : ~ big_h(U_8,U_7),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
! [U_7] : ~ big_h(sK3,U_7),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_8,sK3)],[f_4_3]) ).
fof(f_4_5,negated_conjecture,
! [U_7] : ~ big_h(sK3,U_7),
inference(definitional_conversion,[status(esa)],[f_4_4]) ).
cnf(f_4_6,negated_conjecture,
~ big_h(sK3,U_7),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(t1,plain,
~ big_h(sK3,sK2(sK2(sK3))),
inference(start,[status(thm),parent(0:0)],[f_4_6]) ).
cnf(t2,plain,
( ~ big_g(sK2(sK3),sK2(sK2(sK3)))
| ~ big_g(sK3,sK2(sK3))
| big_h(sK3,sK2(sK2(sK3))) ),
inference(extension,[status(thm),parent(t1:1)],[f_3_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
big_g(sK3,sK2(sK3)),
inference(extension,[status(thm),parent(t2:2)],[f_2_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
big_g(sK2(sK3),sK2(sK2(sK3))),
inference(extension,[status(thm),parent(t2:3)],[f_2_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN065+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.36 % Computer : n013.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sun Sep 20 06:22:57 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.39 % SZS status Theorem for theBenchmark
% 0.09/5.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------