%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PHI013+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 : 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 08:53:57 AM UTC 2026
% Result : Theorem 0.66s 0.99s
% Output : Proof 0.66s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_1,axiom,
! [F] :
( property(F)
=> ( ? [Y] :
( ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> Z = Y ) )
& exemplifies_property(F,Y)
& object(Y) )
=> ? [U] :
( is_the(U,F)
& object(U) ) ) ),
file('theBenchmark.p',description_theorem_1) ).
fof(description_theorem_2,axiom,
! [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(description_is_property_and_described_is_object,axiom,
! [X,F] :
( is_the(X,F)
=> ( object(X)
& property(F) ) ),
file('theBenchmark.p',description_is_property_and_described_is_object) ).
fof(definition_none_greater,axiom,
! [X] :
( object(X)
=> ( exemplifies_property(none_greater,X)
<=> ( ~ ? [Y] :
( exemplifies_property(conceivable,Y)
& exemplifies_relation(greater_than,Y,X)
& object(Y) )
& exemplifies_property(conceivable,X) ) ) ),
file('theBenchmark.p',definition_none_greater) ).
fof(premise_1,axiom,
? [X] :
( exemplifies_property(none_greater,X)
& object(X) ),
file('theBenchmark.p',premise_1) ).
fof(lemma_2,axiom,
( ? [X] :
( exemplifies_property(none_greater,X)
& object(X) )
=> ? [X] :
( ! [Y] :
( object(Y)
=> ( exemplifies_property(none_greater,Y)
=> Y = X ) )
& exemplifies_property(none_greater,X)
& object(X) ) ),
file('theBenchmark.p',lemma_2) ).
fof(premise_2,axiom,
! [X] :
( object(X)
=> ( ( ~ exemplifies_property(existence,X)
& is_the(X,none_greater) )
=> ? [Y] :
( exemplifies_property(conceivable,Y)
& exemplifies_relation(greater_than,Y,X)
& object(Y) ) ) ),
file('theBenchmark.p',premise_2) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('theBenchmark.p',definition_god) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('theBenchmark.p',god_exists) ).
fof(f_1_1,plain,
! [F] :
( ? [U] :
( is_the(U,F)
& object(U) )
| ! [Y] :
( ? [Z] :
( Z != Y
& exemplifies_property(F,Z)
& object(Z) )
| ~ exemplifies_property(F,Y)
| ~ object(Y) )
| ~ property(F) ),
inference(fof_nnf,[status(thm)],[description_theorem_1]) ).
fof(f_1_2,plain,
! [U_3] :
( ? [U_2] :
( is_the(U_2,U_3)
& object(U_2) )
| ! [U_1] :
( ? [U_0] :
( U_0 != U_1
& exemplifies_property(U_3,U_0)
& object(U_0) )
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1) )
| ~ property(U_3) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_3] :
( ? [U_2] :
( is_the(U_2,U_3)
& object(U_2) )
| ! [U_1] :
( ( sK1(U_3,U_1) != U_1
& exemplifies_property(U_3,sK1(U_3,U_1))
& object(sK1(U_3,U_1)) )
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1) )
| ~ property(U_3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_3,U_1))],[f_1_2]) ).
fof(f_1_4,plain,
! [U_3] :
( ( is_the(sK2(U_3),U_3)
& object(sK2(U_3)) )
| ! [U_1] :
( ( sK1(U_3,U_1) != U_1
& exemplifies_property(U_3,sK1(U_3,U_1))
& object(sK1(U_3,U_1)) )
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1) )
| ~ property(U_3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2(U_3))],[f_1_3]) ).
cnf(f_1_5,plain,
( object(sK1(U_3,U_1))
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1)
| object(sK2(U_3))
| ~ property(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_6,plain,
( exemplifies_property(U_3,sK1(U_3,U_1))
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1)
| object(sK2(U_3))
| ~ property(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_7,plain,
( sK1(U_3,U_1) != U_1
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1)
| object(sK2(U_3))
| ~ property(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_8,plain,
( object(sK1(U_3,U_1))
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1)
| is_the(sK2(U_3),U_3)
| ~ property(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_9,plain,
( exemplifies_property(U_3,sK1(U_3,U_1))
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1)
| is_the(sK2(U_3),U_3)
| ~ property(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_10,plain,
( sK1(U_3,U_1) != U_1
| ~ exemplifies_property(U_3,U_1)
| ~ object(U_1)
| is_the(sK2(U_3),U_3)
| ~ property(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_2_1,plain,
! [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)],[description_theorem_2]) ).
fof(f_2_2,plain,
! [U_6] :
( ! [U_5] :
( exemplifies_property(U_6,U_5)
| ~ is_the(U_5,U_6)
| ~ object(U_5) )
| ! [U_4] :
( ~ is_the(U_4,U_6)
| ~ object(U_4) )
| ~ property(U_6) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( exemplifies_property(U_6,U_5)
| ~ is_the(U_5,U_6)
| ~ object(U_5)
| ~ is_the(U_4,U_6)
| ~ object(U_4)
| ~ property(U_6) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [X,F] :
( ( object(X)
& property(F) )
| ~ is_the(X,F) ),
inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object]) ).
fof(f_3_2,plain,
! [U_8,U_7] :
( ( object(U_8)
& property(U_7) )
| ~ is_the(U_8,U_7) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( property(U_7)
| ~ is_the(U_8,U_7) ),
inference(clausify,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( object(U_8)
| ~ is_the(U_8,U_7) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [X] :
( ( ( exemplifies_property(none_greater,X)
| ? [Y] :
( exemplifies_property(conceivable,Y)
& exemplifies_relation(greater_than,Y,X)
& object(Y) )
| ~ exemplifies_property(conceivable,X) )
& ( ( ! [Y] :
( ~ exemplifies_property(conceivable,Y)
| ~ exemplifies_relation(greater_than,Y,X)
| ~ object(Y) )
& exemplifies_property(conceivable,X) )
| ~ exemplifies_property(none_greater,X) ) )
| ~ object(X) ),
inference(fof_nnf,[status(thm)],[definition_none_greater]) ).
fof(f_4_2,plain,
! [U_11] :
( ( ( exemplifies_property(none_greater,U_11)
| ? [U_10] :
( exemplifies_property(conceivable,U_10)
& exemplifies_relation(greater_than,U_10,U_11)
& object(U_10) )
| ~ exemplifies_property(conceivable,U_11) )
& ( ( ! [U_9] :
( ~ exemplifies_property(conceivable,U_9)
| ~ exemplifies_relation(greater_than,U_9,U_11)
| ~ object(U_9) )
& exemplifies_property(conceivable,U_11) )
| ~ exemplifies_property(none_greater,U_11) ) )
| ~ object(U_11) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_11] :
( ( ( exemplifies_property(none_greater,U_11)
| ( exemplifies_property(conceivable,sK3(U_11))
& exemplifies_relation(greater_than,sK3(U_11),U_11)
& object(sK3(U_11)) )
| ~ exemplifies_property(conceivable,U_11) )
& ( ( ! [U_9] :
( ~ exemplifies_property(conceivable,U_9)
| ~ exemplifies_relation(greater_than,U_9,U_11)
| ~ object(U_9) )
& exemplifies_property(conceivable,U_11) )
| ~ exemplifies_property(none_greater,U_11) ) )
| ~ object(U_11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_10,sK3(U_11))],[f_4_2]) ).
cnf(f_4_4,plain,
( exemplifies_property(conceivable,U_11)
| ~ exemplifies_property(none_greater,U_11)
| ~ object(U_11) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_5,plain,
( ~ exemplifies_property(conceivable,U_9)
| ~ exemplifies_relation(greater_than,U_9,U_11)
| ~ object(U_9)
| ~ exemplifies_property(none_greater,U_11)
| ~ object(U_11) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_6,plain,
( object(sK3(U_11))
| ~ exemplifies_property(conceivable,U_11)
| exemplifies_property(none_greater,U_11)
| ~ object(U_11) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_7,plain,
( exemplifies_relation(greater_than,sK3(U_11),U_11)
| ~ exemplifies_property(conceivable,U_11)
| exemplifies_property(none_greater,U_11)
| ~ object(U_11) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_8,plain,
( exemplifies_property(conceivable,sK3(U_11))
| ~ exemplifies_property(conceivable,U_11)
| exemplifies_property(none_greater,U_11)
| ~ object(U_11) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
? [X] :
( exemplifies_property(none_greater,X)
& object(X) ),
inference(fof_nnf,[status(thm)],[premise_1]) ).
fof(f_5_2,plain,
? [U_12] :
( exemplifies_property(none_greater,U_12)
& object(U_12) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( exemplifies_property(none_greater,sK4)
& object(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_12,sK4)],[f_5_2]) ).
cnf(f_5_4,plain,
object(sK4),
inference(clausify,[status(thm)],[f_5_3]) ).
cnf(f_5_5,plain,
exemplifies_property(none_greater,sK4),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
( ? [X] :
( ! [Y] :
( Y = X
| ~ exemplifies_property(none_greater,Y)
| ~ object(Y) )
& exemplifies_property(none_greater,X)
& object(X) )
| ! [X] :
( ~ exemplifies_property(none_greater,X)
| ~ object(X) ) ),
inference(fof_nnf,[status(thm)],[lemma_2]) ).
fof(f_6_2,plain,
( ? [U_15] :
( ! [U_14] :
( U_14 = U_15
| ~ exemplifies_property(none_greater,U_14)
| ~ object(U_14) )
& exemplifies_property(none_greater,U_15)
& object(U_15) )
| ! [U_13] :
( ~ exemplifies_property(none_greater,U_13)
| ~ object(U_13) ) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
( ( ! [U_14] :
( U_14 = sK5
| ~ exemplifies_property(none_greater,U_14)
| ~ object(U_14) )
& exemplifies_property(none_greater,sK5)
& object(sK5) )
| ! [U_13] :
( ~ exemplifies_property(none_greater,U_13)
| ~ object(U_13) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_15,sK5)],[f_6_2]) ).
cnf(f_6_4,plain,
( object(sK5)
| ~ exemplifies_property(none_greater,U_13)
| ~ object(U_13) ),
inference(clausify,[status(thm)],[f_6_3]) ).
cnf(f_6_5,plain,
( exemplifies_property(none_greater,sK5)
| ~ exemplifies_property(none_greater,U_13)
| ~ object(U_13) ),
inference(clausify,[status(thm)],[f_6_3]) ).
cnf(f_6_6,plain,
( U_14 = sK5
| ~ exemplifies_property(none_greater,U_14)
| ~ object(U_14)
| ~ exemplifies_property(none_greater,U_13)
| ~ object(U_13) ),
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_7_1,plain,
! [X] :
( ? [Y] :
( exemplifies_property(conceivable,Y)
& exemplifies_relation(greater_than,Y,X)
& object(Y) )
| exemplifies_property(existence,X)
| ~ is_the(X,none_greater)
| ~ object(X) ),
inference(fof_nnf,[status(thm)],[premise_2]) ).
fof(f_7_2,plain,
! [U_17] :
( ? [U_16] :
( exemplifies_property(conceivable,U_16)
& exemplifies_relation(greater_than,U_16,U_17)
& object(U_16) )
| exemplifies_property(existence,U_17)
| ~ is_the(U_17,none_greater)
| ~ object(U_17) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
! [U_17] :
( ( exemplifies_property(conceivable,sK6(U_17))
& exemplifies_relation(greater_than,sK6(U_17),U_17)
& object(sK6(U_17)) )
| exemplifies_property(existence,U_17)
| ~ is_the(U_17,none_greater)
| ~ object(U_17) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_16,sK6(U_17))],[f_7_2]) ).
cnf(f_7_4,plain,
( object(sK6(U_17))
| exemplifies_property(existence,U_17)
| ~ is_the(U_17,none_greater)
| ~ object(U_17) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_5,plain,
( exemplifies_relation(greater_than,sK6(U_17),U_17)
| exemplifies_property(existence,U_17)
| ~ is_the(U_17,none_greater)
| ~ object(U_17) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_6,plain,
( exemplifies_property(conceivable,sK6(U_17))
| exemplifies_property(existence,U_17)
| ~ is_the(U_17,none_greater)
| ~ object(U_17) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
is_the(god,none_greater),
inference(fof_nnf,[status(thm)],[definition_god]) ).
cnf(f_8_2,plain,
is_the(god,none_greater),
inference(clausify,[status(thm)],[f_8_1]) ).
fof(f_9_1,negated_conjecture,
~ exemplifies_property(existence,god),
inference(negate,[status(cth)],[god_exists]) ).
fof(f_9_2,negated_conjecture,
~ exemplifies_property(existence,god),
inference(definitional_conversion,[status(esa)],[f_9_1]) ).
cnf(f_9_3,negated_conjecture,
~ exemplifies_property(existence,god),
inference(clausify,[status(thm)],[f_9_2]) ).
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_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sK1(Eq_x_0,Eq_x_1) = sK1(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( sK2(Eq_x_0) = sK2(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( sK3(Eq_x_0) = sK3(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( sK6(Eq_x_0) = sK6(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( property(Eq_y_0)
| ~ property(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( object(Eq_y_0)
| ~ object(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_10,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(equality_11,axiom,
( is_the(Eq_y_0,Eq_y_1)
| ~ is_the(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_12,axiom,
( exemplifies_relation(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ exemplifies_relation(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI013+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 : n003.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:43 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.66/0.99 % SZS status Theorem for theBenchmark
% 0.66/0.99 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------