%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN726+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 : n012.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.02s 0.32s
% Output : Proof 0.02s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(thm400,conjecture,
( ! [X,Y] : q(X,Y)
| ( ( ! [X,Y] :
( q(X,Y)
| p(X,Y) )
& ! [X,Y] :
( q(X,Y)
=> q(Y,X) )
& ! [X,Y,Z] :
( ( q(Y,Z)
& q(X,Y) )
=> q(X,Z) )
& ! [X,Y,Z] :
( ( p(Y,Z)
& p(X,Y) )
=> p(X,Z) ) )
=> ! [X,Y] : p(X,Y) ) ),
file('theBenchmark.p',thm400) ).
fof(f_1_1,negated_conjecture,
~ ( ! [X,Y] : q(X,Y)
| ( ( ! [X,Y] :
( q(X,Y)
| p(X,Y) )
& ! [X,Y] :
( q(X,Y)
=> q(Y,X) )
& ! [X,Y,Z] :
( ( q(Y,Z)
& q(X,Y) )
=> q(X,Z) )
& ! [X,Y,Z] :
( ( p(Y,Z)
& p(X,Y) )
=> p(X,Z) ) )
=> ! [X,Y] : p(X,Y) ) ),
inference(negate,[status(cth)],[thm400]) ).
fof(f_1_2,negated_conjecture,
( ? [X,Y] : ~ q(X,Y)
& ? [X,Y] : ~ p(X,Y)
& ! [X,Y] :
( q(X,Y)
| p(X,Y) )
& ! [X,Y] :
( q(Y,X)
| ~ q(X,Y) )
& ! [X,Y,Z] :
( q(X,Z)
| ~ q(Y,Z)
| ~ q(X,Y) )
& ! [X,Y,Z] :
( p(X,Z)
| ~ p(Y,Z)
| ~ p(X,Y) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ? [U_13,U_12] : ~ q(U_13,U_12)
& ? [U_11,U_10] : ~ p(U_11,U_10)
& ! [U_9,U_8] :
( q(U_9,U_8)
| p(U_9,U_8) )
& ! [U_7,U_6] :
( q(U_6,U_7)
| ~ q(U_7,U_6) )
& ! [U_5,U_4,U_3] :
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) )
& ! [U_2,U_1,U_0] :
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_13,U_12] : ~ q(U_13,U_12)
& ? [U_10] : ~ p(sK1,U_10)
& ! [U_9,U_8] :
( q(U_9,U_8)
| p(U_9,U_8) )
& ! [U_7,U_6] :
( q(U_6,U_7)
| ~ q(U_7,U_6) )
& ! [U_5,U_4,U_3] :
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) )
& ! [U_2,U_1,U_0] :
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_11,sK1)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_13,U_12] : ~ q(U_13,U_12)
& ~ p(sK1,sK2)
& ! [U_9,U_8] :
( q(U_9,U_8)
| p(U_9,U_8) )
& ! [U_7,U_6] :
( q(U_6,U_7)
| ~ q(U_7,U_6) )
& ! [U_5,U_4,U_3] :
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) )
& ! [U_2,U_1,U_0] :
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_10,sK2)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ? [U_12] : ~ q(sK3,U_12)
& ~ p(sK1,sK2)
& ! [U_9,U_8] :
( q(U_9,U_8)
| p(U_9,U_8) )
& ! [U_7,U_6] :
( q(U_6,U_7)
| ~ q(U_7,U_6) )
& ! [U_5,U_4,U_3] :
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) )
& ! [U_2,U_1,U_0] :
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_13,sK3)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ~ q(sK3,sK4)
& ~ p(sK1,sK2)
& ! [U_9,U_8] :
( q(U_9,U_8)
| p(U_9,U_8) )
& ! [U_7,U_6] :
( q(U_6,U_7)
| ~ q(U_7,U_6) )
& ! [U_5,U_4,U_3] :
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) )
& ! [U_2,U_1,U_0] :
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_12,sK4)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ~ q(sK3,sK4)
& ~ p(sK1,sK2)
& ! [U_8,U_9] :
( q(U_9,U_8)
| p(U_9,U_8) )
& ! [U_6,U_7] :
( q(U_6,U_7)
| ~ q(U_7,U_6) )
& ! [U_3,U_4,U_5] :
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) )
& ! [U_1,U_2,U_0] :
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ) ),
inference(definitional_conversion,[status(esa)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
( p(U_2,U_0)
| ~ p(U_1,U_0)
| ~ p(U_2,U_1) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( q(U_5,U_3)
| ~ q(U_4,U_3)
| ~ q(U_5,U_4) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_11,negated_conjecture,
( q(U_6,U_7)
| ~ q(U_7,U_6) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_12,negated_conjecture,
( q(U_9,U_8)
| p(U_9,U_8) ),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_13,negated_conjecture,
~ p(sK1,sK2),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(f_1_14,negated_conjecture,
~ q(sK3,sK4),
inference(clausify,[status(thm)],[f_1_8]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN726+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Sun Sep 20 07:07:08 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.02/0.32 % SZS status Theorem for theBenchmark
% 0.02/0.32 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------