%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PHI011+1 : TPTP v9.3.1. Released v7.2.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 08:53:57 AM UTC 2026
% Result : Theorem 0.09s 0.39s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 18 unt; 0 def)
% Number of atoms : 96 ( 7 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 94 ( 29 ~; 20 |; 35 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 13 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lemma_1,axiom,
! [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(description_theorem_2,conjecture,
! [F] :
( property(F)
=> ( ? [Y] :
( is_the(Y,F)
& object(Y) )
=> ! [Z] :
( object(Z)
=> ( is_the(Z,F)
=> exemplifies_property(F,Z) ) ) ) ),
file('theBenchmark.p',description_theorem_2) ).
fof(f_4_1,plain,
! [X,F,Y] :
( exemplifies_property(F,Y)
| X != Y
| ~ is_the(X,F)
| ~ object(Y)
| ~ property(F)
| ~ object(X) ),
inference(fof_nnf,[status(thm)],[lemma_1]) ).
fof(f_4_2,plain,
! [U_7,U_6,U_5] :
( exemplifies_property(U_6,U_5)
| U_7 != U_5
| ~ is_the(U_7,U_6)
| ~ object(U_5)
| ~ property(U_6)
| ~ object(U_7) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
( exemplifies_property(U_6,U_5)
| U_7 != U_5
| ~ is_the(U_7,U_6)
| ~ object(U_5)
| ~ property(U_6)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,negated_conjecture,
~ ! [F] :
( property(F)
=> ( ? [Y] :
( is_the(Y,F)
& object(Y) )
=> ! [Z] :
( object(Z)
=> ( is_the(Z,F)
=> exemplifies_property(F,Z) ) ) ) ),
inference(negate,[status(cth)],[description_theorem_2]) ).
fof(f_5_2,negated_conjecture,
? [F] :
( ? [Z] :
( ~ exemplifies_property(F,Z)
& is_the(Z,F)
& object(Z) )
& ? [Y] :
( is_the(Y,F)
& object(Y) )
& property(F) ),
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
? [U_10] :
( ? [U_9] :
( ~ exemplifies_property(U_10,U_9)
& is_the(U_9,U_10)
& object(U_9) )
& ? [U_8] :
( is_the(U_8,U_10)
& object(U_8) )
& property(U_10) ),
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
( ? [U_9] :
( ~ exemplifies_property(sK1,U_9)
& is_the(U_9,sK1)
& object(U_9) )
& ? [U_8] :
( is_the(U_8,sK1)
& object(U_8) )
& property(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_10,sK1)],[f_5_3]) ).
fof(f_5_5,negated_conjecture,
( ? [U_9] :
( ~ exemplifies_property(sK1,U_9)
& is_the(U_9,sK1)
& object(U_9) )
& is_the(sK2,sK1)
& object(sK2)
& property(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_8,sK2)],[f_5_4]) ).
fof(f_5_6,negated_conjecture,
( ~ exemplifies_property(sK1,sK3)
& is_the(sK3,sK1)
& object(sK3)
& is_the(sK2,sK1)
& object(sK2)
& property(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_9,sK3)],[f_5_5]) ).
fof(f_5_7,negated_conjecture,
( ~ exemplifies_property(sK1,sK3)
& is_the(sK3,sK1)
& object(sK3)
& is_the(sK2,sK1)
& object(sK2)
& property(sK1) ),
inference(definitional_conversion,[status(esa)],[f_5_6]) ).
cnf(f_5_8,negated_conjecture,
property(sK1),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_11,negated_conjecture,
object(sK3),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_12,negated_conjecture,
is_the(sK3,sK1),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(f_5_13,negated_conjecture,
~ exemplifies_property(sK1,sK3),
inference(clausify,[status(thm)],[f_5_7]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(t1,plain,
~ exemplifies_property(sK1,sK3),
inference(start,[status(thm),parent(0:0)],[f_5_13]) ).
cnf(t2,plain,
( ~ property(sK1)
| ~ object(sK3)
| ~ is_the(sK3,sK1)
| sK3 != sK3
| ~ object(sK3)
| exemplifies_property(sK1,sK3) ),
inference(extension,[status(thm),parent(t1:1)],[f_4_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
object(sK3),
inference(extension,[status(thm),parent(t2:2)],[f_5_11]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(l2,lemma,
object(sK3),
inference(lemma,[status(cth),parent(t2:2),below(t1:1)],[t2:2]) ).
cnf(t6,plain,
sK3 = sK3,
inference(extension,[status(thm),parent(t2:3)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
is_the(sK3,sK1),
inference(extension,[status(thm),parent(t2:4)],[f_5_12]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
cnf(t10,plain,
object(sK3),
inference(lemma_extension,[status(thm),parent(t2:5)],[l2:1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:5]) ).
cnf(t12,plain,
property(sK1),
inference(extension,[status(thm),parent(t2:6)],[f_5_8]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI011+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 19:37:01 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.39 % SZS status Theorem for theBenchmark
% 0.09/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------