%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PHI010+1 : TPTP v9.3.1. Released v7.2.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 : n008.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 08:53:57 AM UTC 2026
% Result : Theorem 0.10s 0.38s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 34 unt; 0 def)
% Number of atoms : 205 ( 54 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 231 ( 81 ~; 72 |; 70 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 58 ( 0 sgn 30 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_axiom_identity_instance,axiom,
! [F,X,W] :
( ( object(W)
& object(X)
& property(F) )
=> ( ( X = W
& is_the(X,F) )
<=> ? [Y] :
( Y = W
& ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> Z = Y ) )
& exemplifies_property(F,Y)
& object(Y) ) ) ),
file('theBenchmark.p',description_axiom_identity_instance) ).
fof(lemma_1,conjecture,
! [X,F,Y] :
( ( object(Y)
& property(F)
& object(X) )
=> ( ( X = Y
& is_the(X,F) )
=> exemplifies_property(F,Y) ) ),
file('theBenchmark.p',lemma_1) ).
fof(f_4_1,plain,
! [F,X,W] :
( ( ( ( X = W
& is_the(X,F) )
| ! [Y] :
( Y != W
| ? [Z] :
( Z != Y
& exemplifies_property(F,Z)
& object(Z) )
| ~ exemplifies_property(F,Y)
| ~ object(Y) ) )
& ( ? [Y] :
( Y = W
& ! [Z] :
( Z = Y
| ~ exemplifies_property(F,Z)
| ~ object(Z) )
& exemplifies_property(F,Y)
& object(Y) )
| X != W
| ~ is_the(X,F) ) )
| ~ object(W)
| ~ object(X)
| ~ property(F) ),
inference(fof_nnf,[status(thm)],[description_axiom_identity_instance]) ).
fof(f_4_2,plain,
! [U_11,U_10,U_9] :
( ( ( ( U_10 = U_9
& is_the(U_10,U_11) )
| ! [U_8] :
( U_8 != U_9
| ? [U_7] :
( U_7 != U_8
& exemplifies_property(U_11,U_7)
& object(U_7) )
| ~ exemplifies_property(U_11,U_8)
| ~ object(U_8) ) )
& ( ? [U_6] :
( U_6 = U_9
& ! [U_5] :
( U_5 = U_6
| ~ exemplifies_property(U_11,U_5)
| ~ object(U_5) )
& exemplifies_property(U_11,U_6)
& object(U_6) )
| U_10 != U_9
| ~ is_the(U_10,U_11) ) )
| ~ object(U_9)
| ~ object(U_10)
| ~ property(U_11) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_11,U_10,U_9] :
( ( ( ( U_10 = U_9
& is_the(U_10,U_11) )
| ! [U_8] :
( U_8 != U_9
| ? [U_7] :
( U_7 != U_8
& exemplifies_property(U_11,U_7)
& object(U_7) )
| ~ exemplifies_property(U_11,U_8)
| ~ object(U_8) ) )
& ( ( sK1(U_11,U_10,U_9) = U_9
& ! [U_5] :
( U_5 = sK1(U_11,U_10,U_9)
| ~ exemplifies_property(U_11,U_5)
| ~ object(U_5) )
& exemplifies_property(U_11,sK1(U_11,U_10,U_9))
& object(sK1(U_11,U_10,U_9)) )
| U_10 != U_9
| ~ is_the(U_10,U_11) ) )
| ~ object(U_9)
| ~ object(U_10)
| ~ property(U_11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1(U_11,U_10,U_9))],[f_4_2]) ).
fof(f_4_4,plain,
! [U_11,U_10,U_9] :
( ( ( ( U_10 = U_9
& is_the(U_10,U_11) )
| ! [U_8] :
( U_8 != U_9
| ( sK2(U_11,U_10,U_9,U_8) != U_8
& exemplifies_property(U_11,sK2(U_11,U_10,U_9,U_8))
& object(sK2(U_11,U_10,U_9,U_8)) )
| ~ exemplifies_property(U_11,U_8)
| ~ object(U_8) ) )
& ( ( sK1(U_11,U_10,U_9) = U_9
& ! [U_5] :
( U_5 = sK1(U_11,U_10,U_9)
| ~ exemplifies_property(U_11,U_5)
| ~ object(U_5) )
& exemplifies_property(U_11,sK1(U_11,U_10,U_9))
& object(sK1(U_11,U_10,U_9)) )
| U_10 != U_9
| ~ is_the(U_10,U_11) ) )
| ~ object(U_9)
| ~ object(U_10)
| ~ property(U_11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_7,sK2(U_11,U_10,U_9,U_8))],[f_4_3]) ).
cnf(f_4_6,plain,
( exemplifies_property(U_11,sK1(U_11,U_10,U_9))
| U_10 != U_9
| ~ is_the(U_10,U_11)
| ~ object(U_9)
| ~ object(U_10)
| ~ property(U_11) ),
inference(clausify,[status(thm)],[f_4_4]) ).
cnf(f_4_8,plain,
( sK1(U_11,U_10,U_9) = U_9
| U_10 != U_9
| ~ is_the(U_10,U_11)
| ~ object(U_9)
| ~ object(U_10)
| ~ property(U_11) ),
inference(clausify,[status(thm)],[f_4_4]) ).
fof(f_5_1,negated_conjecture,
~ ! [X,F,Y] :
( ( object(Y)
& property(F)
& object(X) )
=> ( ( X = Y
& is_the(X,F) )
=> exemplifies_property(F,Y) ) ),
inference(negate,[status(cth)],[lemma_1]) ).
fof(f_5_2,negated_conjecture,
? [X,F,Y] :
( ~ exemplifies_property(F,Y)
& X = Y
& is_the(X,F)
& object(Y)
& property(F)
& object(X) ),
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
? [U_14,U_13,U_12] :
( ~ exemplifies_property(U_13,U_12)
& U_14 = U_12
& is_the(U_14,U_13)
& object(U_12)
& property(U_13)
& object(U_14) ),
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
? [U_13,U_12] :
( ~ exemplifies_property(U_13,U_12)
& sK3 = U_12
& is_the(sK3,U_13)
& object(U_12)
& property(U_13)
& object(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_14,sK3)],[f_5_3]) ).
fof(f_5_5,negated_conjecture,
? [U_12] :
( ~ exemplifies_property(sK4,U_12)
& sK3 = U_12
& is_the(sK3,sK4)
& object(U_12)
& property(sK4)
& object(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_13,sK4)],[f_5_4]) ).
fof(f_5_6,negated_conjecture,
( ~ exemplifies_property(sK4,sK5)
& sK3 = sK5
& is_the(sK3,sK4)
& object(sK5)
& property(sK4)
& object(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_12,sK5)],[f_5_5]) ).
fof(f_5_7,negated_conjecture,
( ~ exemplifies_property(sK4,sK5)
& sK3 = sK5
& is_the(sK3,sK4)
& object(sK5)
& property(sK4)
& object(sK3) ),
inference(definitional_conversion,[status(esa)],[f_5_6]) ).
cnf(f_5_8,negated_conjecture,
object(sK3),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_9,negated_conjecture,
property(sK4),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_10,negated_conjecture,
object(sK5),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_11,negated_conjecture,
is_the(sK3,sK4),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_12,negated_conjecture,
sK3 = sK5,
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_13,negated_conjecture,
~ exemplifies_property(sK4,sK5),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_8,axiom,
( exemplifies_property(Eq_y_0,Eq_y_1)
| ~ exemplifies_property(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ exemplifies_property(sK4,sK5),
inference(start,[status(thm),parent(0:0)],[f_5_13]) ).
cnf(t2,plain,
( sK1(sK4,sK3,sK5) != sK5
| ~ exemplifies_property(sK4,sK1(sK4,sK3,sK5))
| sK4 != sK4
| exemplifies_property(sK4,sK5) ),
inference(extension,[status(thm),parent(t1:1)],[equality_8]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( sK4 != sK4
| sK4 = sK4 ),
inference(extension,[status(thm),parent(t2:2)],[equality_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
sK4 = sK4,
inference(extension,[status(thm),parent(t4:2)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ object(sK3)
| ~ object(sK5)
| ~ is_the(sK3,sK4)
| sK3 != sK5
| ~ property(sK4)
| exemplifies_property(sK4,sK1(sK4,sK3,sK5)) ),
inference(extension,[status(thm),parent(t2:3)],[f_4_6]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
property(sK4),
inference(extension,[status(thm),parent(t8:2)],[f_5_9]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
sK3 = sK5,
inference(extension,[status(thm),parent(t8:3)],[f_5_12]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
is_the(sK3,sK4),
inference(extension,[status(thm),parent(t8:4)],[f_5_11]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t8:4]) ).
cnf(t16,plain,
object(sK5),
inference(extension,[status(thm),parent(t8:5)],[f_5_10]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t8:5]) ).
cnf(t18,plain,
object(sK3),
inference(extension,[status(thm),parent(t8:6)],[f_5_8]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t8:6]) ).
cnf(t20,plain,
( ~ object(sK3)
| ~ object(sK5)
| ~ is_the(sK3,sK4)
| sK3 != sK5
| ~ property(sK4)
| sK1(sK4,sK3,sK5) = sK5 ),
inference(extension,[status(thm),parent(t2:4)],[f_4_8]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t2:4]) ).
cnf(t22,plain,
property(sK4),
inference(extension,[status(thm),parent(t20:2)],[f_5_9]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
sK3 = sK5,
inference(extension,[status(thm),parent(t20:3)],[f_5_12]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).
cnf(t26,plain,
is_the(sK3,sK4),
inference(extension,[status(thm),parent(t20:4)],[f_5_11]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t20:4]) ).
cnf(t28,plain,
object(sK5),
inference(extension,[status(thm),parent(t20:5)],[f_5_10]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t20:5]) ).
cnf(t30,plain,
object(sK3),
inference(extension,[status(thm),parent(t20:6)],[f_5_8]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t20:6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PHI010+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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.10/0.35 % Computer : n008.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 19 19:36:53 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.38 % SZS status Theorem for theBenchmark
% 0.10/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------