%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN411+1 : TPTP v9.3.1. Released v2.0.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 : n020.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:18 AM UTC 2026
% Result : Theorem 0.14s 0.39s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 87 ( 40 ~; 25 |; 20 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 129 ( 18 sgn 72 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish250,conjecture,
( ! [X,Y,Z] : f(X,Y,Z)
<=> ~ ? [U,V,W] : ~ f(U,V,W) ),
file('theBenchmark.p',kalish250) ).
fof(f_1_1,negated_conjecture,
~ ( ! [X,Y,Z] : f(X,Y,Z)
<=> ~ ? [U,V,W] : ~ f(U,V,W) ),
inference(negate,[status(cth)],[kalish250]) ).
fof(f_1_2,negated_conjecture,
( ( ? [X,Y,Z] : ~ f(X,Y,Z)
& ! [U,V,W] : f(U,V,W) )
| ( ? [U,V,W] : ~ f(U,V,W)
& ! [X,Y,Z] : f(X,Y,Z) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ? [U_11,U_10,U_9] : ~ f(U_11,U_10,U_9)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ? [U_5,U_4,U_3] : ~ f(U_5,U_4,U_3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ? [U_11,U_10,U_9] : ~ f(U_11,U_10,U_9)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ? [U_4,U_3] : ~ f(sK1,U_4,U_3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_5,sK1)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ? [U_11,U_10,U_9] : ~ f(U_11,U_10,U_9)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ? [U_3] : ~ f(sK1,sK2,U_3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_4,sK2)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ? [U_11,U_10,U_9] : ~ f(U_11,U_10,U_9)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ~ f(sK1,sK2,sK3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_3,sK3)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ? [U_10,U_9] : ~ f(sK4,U_10,U_9)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ~ f(sK1,sK2,sK3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_11,sK4)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ? [U_9] : ~ f(sK4,sK5,U_9)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ~ f(sK1,sK2,sK3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_10,sK5)],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ( ~ f(sK4,sK5,sK6)
& ! [U_8,U_7,U_6] : f(U_8,U_7,U_6) )
| ( ~ f(sK1,sK2,sK3)
& ! [U_2,U_1,U_0] : f(U_2,U_1,U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_9,sK6)],[f_1_8]) ).
fof(f_1_10,negated_conjecture,
( ! [U_6,U_7,U_8] :
( ~ f(sK4,sK5,sK6)
| ~ sP1(U_6,U_7,U_8) )
& ! [U_6,U_7,U_8] :
( f(U_8,U_7,U_6)
| ~ sP1(U_6,U_7,U_8) )
& ! [U_0,U_1,U_2] :
( ~ f(sK1,sK2,sK3)
| ~ sP0(U_0,U_1,U_2) )
& ! [U_0,U_1,U_2] :
( f(U_2,U_1,U_0)
| ~ sP0(U_0,U_1,U_2) )
& ! [U_0,U_1,U_2,U_6,U_7,U_8] :
( sP1(U_6,U_7,U_8)
| sP0(U_0,U_1,U_2) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( sP1(U_6,U_7,U_8)
| sP0(U_0,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_12,negated_conjecture,
( f(U_2,U_1,U_0)
| ~ sP0(U_0,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_13,negated_conjecture,
( ~ f(sK1,sK2,sK3)
| ~ sP0(U_0,U_1,U_2) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_14,negated_conjecture,
( f(U_8,U_7,U_6)
| ~ sP1(U_6,U_7,U_8) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_15,negated_conjecture,
( ~ f(sK4,sK5,sK6)
| ~ sP1(U_6,U_7,U_8) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(t1,plain,
( ~ f(sK1,sK2,sK3)
| ~ sP0(U_105,U_106,U_107) ),
inference(start,[status(thm),parent(0:0)],[f_1_13]) ).
cnf(t2,plain,
( sP1(sK6,sK5,sK4)
| sP0(U_105,U_106,U_107) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_11]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ f(sK4,sK5,sK6)
| ~ sP1(sK6,sK5,sK4) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_15]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ sP1(sK6,sK5,sK4)
| f(sK4,sK5,sK6) ),
inference(extension,[status(thm),parent(t4:2)],[f_1_14]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
$false,
inference(reduction,[status(thm),parent(t6:2)],[t6:2,t2:2]) ).
cnf(t9,plain,
( ~ sP1(sK3,sK2,sK1)
| f(sK1,sK2,sK3) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_14]) ).
cnf(t10,plain,
$false,
inference(connection,[status(thm),parent(t9:1)],[t9:1,t1:2]) ).
cnf(t11,plain,
( sP0(sK3,sK2,sK1)
| sP1(sK3,sK2,sK1) ),
inference(extension,[status(thm),parent(t9:2)],[f_1_11]) ).
cnf(t12,plain,
$false,
inference(connection,[status(thm),parent(t11:1)],[t11:1,t9:2]) ).
cnf(t13,plain,
( f(sK1,sK2,sK3)
| ~ sP0(sK3,sK2,sK1) ),
inference(extension,[status(thm),parent(t11:2)],[f_1_12]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t11:2]) ).
cnf(t15,plain,
$false,
inference(reduction,[status(thm),parent(t13:2)],[t13:2,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN411+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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 06:31:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------