%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN413+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 : n003.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.10s 0.41s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 29 ( 12 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 91 ( 34 ~; 32 |; 22 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 53 ( 2 sgn 33 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish256,conjecture,
( ! [Z] :
? [Y] :
! [X] :
( f(X,Y)
<=> ( ~ f(X,X)
& f(X,Z) ) )
=> ~ ? [V] :
! [U] : f(U,V) ),
file('theBenchmark.p',kalish256) ).
fof(f_1_1,negated_conjecture,
( ? [V] :
! [U] : f(U,V)
& ! [Z] :
? [Y] :
! [X] :
( f(X,Y)
<=> ( ~ f(X,X)
& f(X,Z) ) ) ),
inference(negate,[status(cth)],[kalish256]) ).
fof(f_1_2,negated_conjecture,
( ? [V] :
! [U] : f(U,V)
& ! [Z] :
? [Y] :
! [X] :
( ( f(X,Y)
| f(X,X)
| ~ f(X,Z) )
& ( ( ~ f(X,X)
& f(X,Z) )
| ~ f(X,Y) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ? [U_4] :
! [U_3] : f(U_3,U_4)
& ! [U_2] :
? [U_1] :
! [U_0] :
( ( f(U_0,U_1)
| f(U_0,U_0)
| ~ f(U_0,U_2) )
& ( ( ~ f(U_0,U_0)
& f(U_0,U_2) )
| ~ f(U_0,U_1) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_4] :
! [U_3] : f(U_3,U_4)
& ! [U_2] :
? [U_1] :
( ! [U_6] :
( f(U_6,U_1)
| f(U_6,U_6)
| ~ f(U_6,U_2) )
& ! [U_5] :
( ( ~ f(U_5,U_5)
& f(U_5,U_2) )
| ~ f(U_5,U_1) ) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_4] :
! [U_3] : f(U_3,U_4)
& ! [U_2] :
( ! [U_6] :
( f(U_6,sK1(U_2))
| f(U_6,U_6)
| ~ f(U_6,U_2) )
& ! [U_5] :
( ( ~ f(U_5,U_5)
& f(U_5,U_2) )
| ~ f(U_5,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_3] : f(U_3,sK2)
& ! [U_2] :
( ! [U_6] :
( f(U_6,sK1(U_2))
| f(U_6,U_6)
| ~ f(U_6,U_2) )
& ! [U_5] :
( ( ~ f(U_5,U_5)
& f(U_5,U_2) )
| ~ f(U_5,sK1(U_2)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_4,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_2,U_5] :
( ~ f(U_5,U_5)
| ~ sP0(U_2,U_5) )
& ! [U_2,U_5] :
( f(U_5,U_2)
| ~ sP0(U_2,U_5) )
& ! [U_3] : f(U_3,sK2)
& ! [U_2,U_6] :
( f(U_6,sK1(U_2))
| f(U_6,U_6)
| ~ f(U_6,U_2) )
& ! [U_2,U_5] :
( sP0(U_2,U_5)
| ~ f(U_5,sK1(U_2)) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( sP0(U_2,U_5)
| ~ f(U_5,sK1(U_2)) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
( f(U_6,sK1(U_2))
| f(U_6,U_6)
| ~ f(U_6,U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_10,negated_conjecture,
f(U_3,sK2),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_11,negated_conjecture,
( f(U_5,U_2)
| ~ sP0(U_2,U_5) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_12,negated_conjecture,
( ~ f(U_5,U_5)
| ~ sP0(U_2,U_5) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
( ~ f(sK1(sK2),sK1(sK2))
| ~ sP0(sK2,sK1(sK2)) ),
inference(start,[status(thm),parent(0:0)],[f_1_12]) ).
cnf(t2,plain,
( ~ f(sK1(sK2),sK1(sK2))
| sP0(sK2,sK1(sK2)) ),
inference(extension,[status(thm),parent(t1:1)],[f_1_8]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( f(sK1(sK2),sK1(sK2))
| ~ f(sK1(sK2),sK2)
| f(sK1(sK2),sK1(sK2)) ),
inference(extension,[status(thm),parent(t2:2)],[f_1_9]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
f(sK1(sK2),sK2),
inference(extension,[status(thm),parent(t4:2)],[f_1_10]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
$false,
inference(reduction,[status(thm),parent(t4:3)],[t4:3,t2:2]) ).
cnf(l1,lemma,
sP0(sK2,sK1(sK2)),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t9,plain,
( f(sK1(sK2),sK1(sK2))
| ~ f(sK1(sK2),sK2)
| f(sK1(sK2),sK1(sK2)) ),
inference(extension,[status(thm),parent(t1:2)],[f_1_9]) ).
cnf(t10,plain,
$false,
inference(connection,[status(thm),parent(t9:1)],[t9:1,t1:2]) ).
cnf(t11,plain,
( ~ sP0(sK2,sK1(sK2))
| f(sK1(sK2),sK2) ),
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,
sP0(sK2,sK1(sK2)),
inference(lemma_extension,[status(thm),parent(t11:2)],[l1:1]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t11:2]) ).
cnf(t15,plain,
$false,
inference(reduction,[status(thm),parent(t9:3)],[t9:3,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN413+1 : TPTP v9.3.1. Released v2.0.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.10/0.38 % Computer : n003.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 06:33:45 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.41 % SZS status Theorem for theBenchmark
% 0.10/0.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------