%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PHI014+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 : n026.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.11s 0.40s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
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_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] :
( ! [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_1_2,plain,
! [U_2] :
( ! [U_1] :
( exemplifies_property(U_2,U_1)
| ~ is_the(U_1,U_2)
| ~ object(U_1) )
| ! [U_0] :
( ~ is_the(U_0,U_2)
| ~ object(U_0) )
| ~ property(U_2) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( exemplifies_property(U_2,U_1)
| ~ is_the(U_1,U_2)
| ~ object(U_1)
| ~ is_the(U_0,U_2)
| ~ object(U_0)
| ~ property(U_2) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_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_2_2,plain,
! [U_4,U_3] :
( ( object(U_4)
& property(U_3) )
| ~ is_the(U_4,U_3) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( property(U_3)
| ~ is_the(U_4,U_3) ),
inference(clausify,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( object(U_4)
| ~ is_the(U_4,U_3) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_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_3_2,plain,
! [U_7] :
( ( ( exemplifies_property(none_greater,U_7)
| ? [U_6] :
( exemplifies_property(conceivable,U_6)
& exemplifies_relation(greater_than,U_6,U_7)
& object(U_6) )
| ~ exemplifies_property(conceivable,U_7) )
& ( ( ! [U_5] :
( ~ exemplifies_property(conceivable,U_5)
| ~ exemplifies_relation(greater_than,U_5,U_7)
| ~ object(U_5) )
& exemplifies_property(conceivable,U_7) )
| ~ exemplifies_property(none_greater,U_7) ) )
| ~ object(U_7) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
! [U_7] :
( ( ( exemplifies_property(none_greater,U_7)
| ( exemplifies_property(conceivable,sK1(U_7))
& exemplifies_relation(greater_than,sK1(U_7),U_7)
& object(sK1(U_7)) )
| ~ exemplifies_property(conceivable,U_7) )
& ( ( ! [U_5] :
( ~ exemplifies_property(conceivable,U_5)
| ~ exemplifies_relation(greater_than,U_5,U_7)
| ~ object(U_5) )
& exemplifies_property(conceivable,U_7) )
| ~ exemplifies_property(none_greater,U_7) ) )
| ~ object(U_7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_6,sK1(U_7))],[f_3_2]) ).
cnf(f_3_4,plain,
( exemplifies_property(conceivable,U_7)
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( ~ exemplifies_property(conceivable,U_5)
| ~ exemplifies_relation(greater_than,U_5,U_7)
| ~ object(U_5)
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_6,plain,
( object(sK1(U_7))
| ~ exemplifies_property(conceivable,U_7)
| exemplifies_property(none_greater,U_7)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_7,plain,
( exemplifies_relation(greater_than,sK1(U_7),U_7)
| ~ exemplifies_property(conceivable,U_7)
| exemplifies_property(none_greater,U_7)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_8,plain,
( exemplifies_property(conceivable,sK1(U_7))
| ~ exemplifies_property(conceivable,U_7)
| exemplifies_property(none_greater,U_7)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_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_4_2,plain,
! [U_9] :
( ? [U_8] :
( exemplifies_property(conceivable,U_8)
& exemplifies_relation(greater_than,U_8,U_9)
& object(U_8) )
| exemplifies_property(existence,U_9)
| ~ is_the(U_9,none_greater)
| ~ object(U_9) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_9] :
( ( exemplifies_property(conceivable,sK2(U_9))
& exemplifies_relation(greater_than,sK2(U_9),U_9)
& object(sK2(U_9)) )
| exemplifies_property(existence,U_9)
| ~ is_the(U_9,none_greater)
| ~ object(U_9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_8,sK2(U_9))],[f_4_2]) ).
cnf(f_4_4,plain,
( object(sK2(U_9))
| exemplifies_property(existence,U_9)
| ~ is_the(U_9,none_greater)
| ~ object(U_9) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_5,plain,
( exemplifies_relation(greater_than,sK2(U_9),U_9)
| exemplifies_property(existence,U_9)
| ~ is_the(U_9,none_greater)
| ~ object(U_9) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_6,plain,
( exemplifies_property(conceivable,sK2(U_9))
| exemplifies_property(existence,U_9)
| ~ is_the(U_9,none_greater)
| ~ object(U_9) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
is_the(god,none_greater),
inference(fof_nnf,[status(thm)],[definition_god]) ).
cnf(f_5_2,plain,
is_the(god,none_greater),
inference(clausify,[status(thm)],[f_5_1]) ).
fof(f_6_1,negated_conjecture,
~ exemplifies_property(existence,god),
inference(negate,[status(cth)],[god_exists]) ).
fof(f_6_2,negated_conjecture,
~ exemplifies_property(existence,god),
inference(definitional_conversion,[status(esa)],[f_6_1]) ).
cnf(f_6_3,negated_conjecture,
~ exemplifies_property(existence,god),
inference(clausify,[status(thm)],[f_6_2]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PHI014+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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.07/0.34 % Computer : n026.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 19 19:38:50 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.11/0.40 % SZS status Theorem for theBenchmark
% 0.11/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------