%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN364+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 : n017.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:10 AM UTC 2026
% Result : Theorem 0.11s 0.37s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(x2115,conjecture,
( ( ! [W] :
( big_q(W)
=> ~ big_m(g(W)) )
& ! [U] :
? [V] :
( ( big_q(f(U,V))
& big_m(U) )
| big_p(U,V) )
& ! [X] :
( ? [Y] : big_p(X,Y)
=> ! [Z] : big_p(Z,Z) ) )
=> ! [U] :
? [V] :
( big_p(U,U)
& big_p(g(U),V) ) ),
file('theBenchmark.p',x2115) ).
fof(f_1_1,negated_conjecture,
( ~ ! [U] :
? [V] :
( big_p(U,U)
& big_p(g(U),V) )
& ! [W] :
( big_q(W)
=> ~ big_m(g(W)) )
& ! [U] :
? [V] :
( ( big_q(f(U,V))
& big_m(U) )
| big_p(U,V) )
& ! [X] :
( ? [Y] : big_p(X,Y)
=> ! [Z] : big_p(Z,Z) ) ),
inference(negate,[status(cth)],[x2115]) ).
fof(f_1_2,negated_conjecture,
( ? [U] :
! [V] :
( ~ big_p(U,U)
| ~ big_p(g(U),V) )
& ! [W] :
( ~ big_m(g(W))
| ~ big_q(W) )
& ! [U] :
? [V] :
( ( big_q(f(U,V))
& big_m(U) )
| big_p(U,V) )
& ! [X] :
( ! [Z] : big_p(Z,Z)
| ! [Y] : ~ big_p(X,Y) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ? [U_7] :
! [U_6] :
( ~ big_p(U_7,U_7)
| ~ big_p(g(U_7),U_6) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
? [U_3] :
( ( big_q(f(U_4,U_3))
& big_m(U_4) )
| big_p(U_4,U_3) )
& ! [U_2] :
( ! [U_1] : big_p(U_1,U_1)
| ! [U_0] : ~ big_p(U_2,U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ? [U_11] :
! [U_6] : ~ big_p(g(U_11),U_6)
| ? [U_10] : ~ big_p(U_10,U_10) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
( ( ? [U_9] : big_q(f(U_4,U_9))
& big_m(U_4) )
| ? [U_8] : big_p(U_4,U_8) )
& ( ! [U_2,U_0] : ~ big_p(U_2,U_0)
| ! [U_1] : big_p(U_1,U_1) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ? [U_11] :
! [U_6] : ~ big_p(g(U_11),U_6)
| ? [U_10] : ~ big_p(U_10,U_10) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
( ( ? [U_9] : big_q(f(U_4,U_9))
& big_m(U_4) )
| big_p(U_4,sK1(U_4)) )
& ( ! [U_2,U_0] : ~ big_p(U_2,U_0)
| ! [U_1] : big_p(U_1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1(U_4))],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ? [U_11] :
! [U_6] : ~ big_p(g(U_11),U_6)
| ? [U_10] : ~ big_p(U_10,U_10) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
( ( big_q(f(U_4,sK2(U_4)))
& big_m(U_4) )
| big_p(U_4,sK1(U_4)) )
& ( ! [U_2,U_0] : ~ big_p(U_2,U_0)
| ! [U_1] : big_p(U_1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2(U_4))],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ? [U_11] :
! [U_6] : ~ big_p(g(U_11),U_6)
| ~ big_p(sK3,sK3) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
( ( big_q(f(U_4,sK2(U_4)))
& big_m(U_4) )
| big_p(U_4,sK1(U_4)) )
& ( ! [U_2,U_0] : ~ big_p(U_2,U_0)
| ! [U_1] : big_p(U_1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_10,sK3)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ! [U_6] : ~ big_p(g(sK4),U_6)
| ~ big_p(sK3,sK3) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
( ( big_q(f(U_4,sK2(U_4)))
& big_m(U_4) )
| big_p(U_4,sK1(U_4)) )
& ( ! [U_2,U_0] : ~ big_p(U_2,U_0)
| ! [U_1] : big_p(U_1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_11,sK4)],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ! [U_4] :
( big_q(f(U_4,sK2(U_4)))
| ~ sP0(U_4) )
& ! [U_4] :
( big_m(U_4)
| ~ sP0(U_4) )
& ! [U_6] :
( ~ big_p(g(sK4),U_6)
| ~ big_p(sK3,sK3) )
& ! [U_5] :
( ~ big_m(g(U_5))
| ~ big_q(U_5) )
& ! [U_4] :
( sP0(U_4)
| big_p(U_4,sK1(U_4)) )
& ! [U_0,U_2,U_1] :
( ~ big_p(U_2,U_0)
| big_p(U_1,U_1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( ~ big_p(U_2,U_0)
| big_p(U_1,U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( sP0(U_4)
| big_p(U_4,sK1(U_4)) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_12,negated_conjecture,
( ~ big_m(g(U_5))
| ~ big_q(U_5) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_13,negated_conjecture,
( ~ big_p(g(sK4),U_6)
| ~ big_p(sK3,sK3) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_14,negated_conjecture,
( big_m(U_4)
| ~ sP0(U_4) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_15,negated_conjecture,
( big_q(f(U_4,sK2(U_4)))
| ~ sP0(U_4) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN364+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 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.08/0.34 % Computer : n017.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 20 06:24:40 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.11/0.37 % SZS status Theorem for theBenchmark
% 0.11/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------