%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PHI012+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 : n004.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.14s 0.39s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
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(connectedness_of_greater_than,axiom,
! [X,Y] :
( ( object(Y)
& object(X) )
=> ( X = Y
| exemplifies_relation(greater_than,Y,X)
| exemplifies_relation(greater_than,X,Y) ) ),
file('theBenchmark.p',connectedness_of_greater_than) ).
fof(lemma_2,conjecture,
( ? [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(f_1_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_1_2,plain,
! [U_2] :
( ( ( exemplifies_property(none_greater,U_2)
| ? [U_1] :
( exemplifies_property(conceivable,U_1)
& exemplifies_relation(greater_than,U_1,U_2)
& object(U_1) )
| ~ exemplifies_property(conceivable,U_2) )
& ( ( ! [U_0] :
( ~ exemplifies_property(conceivable,U_0)
| ~ exemplifies_relation(greater_than,U_0,U_2)
| ~ object(U_0) )
& exemplifies_property(conceivable,U_2) )
| ~ exemplifies_property(none_greater,U_2) ) )
| ~ object(U_2) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_2] :
( ( ( exemplifies_property(none_greater,U_2)
| ( exemplifies_property(conceivable,sK1(U_2))
& exemplifies_relation(greater_than,sK1(U_2),U_2)
& object(sK1(U_2)) )
| ~ exemplifies_property(conceivable,U_2) )
& ( ( ! [U_0] :
( ~ exemplifies_property(conceivable,U_0)
| ~ exemplifies_relation(greater_than,U_0,U_2)
| ~ object(U_0) )
& exemplifies_property(conceivable,U_2) )
| ~ exemplifies_property(none_greater,U_2) ) )
| ~ object(U_2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1(U_2))],[f_1_2]) ).
cnf(f_1_4,plain,
( exemplifies_property(conceivable,U_2)
| ~ exemplifies_property(none_greater,U_2)
| ~ object(U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_5,plain,
( ~ exemplifies_property(conceivable,U_0)
| ~ exemplifies_relation(greater_than,U_0,U_2)
| ~ object(U_0)
| ~ exemplifies_property(none_greater,U_2)
| ~ object(U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_6,plain,
( object(sK1(U_2))
| ~ exemplifies_property(conceivable,U_2)
| exemplifies_property(none_greater,U_2)
| ~ object(U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_7,plain,
( exemplifies_relation(greater_than,sK1(U_2),U_2)
| ~ exemplifies_property(conceivable,U_2)
| exemplifies_property(none_greater,U_2)
| ~ object(U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_8,plain,
( exemplifies_property(conceivable,sK1(U_2))
| ~ exemplifies_property(conceivable,U_2)
| exemplifies_property(none_greater,U_2)
| ~ object(U_2) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [X,Y] :
( X = Y
| exemplifies_relation(greater_than,Y,X)
| exemplifies_relation(greater_than,X,Y)
| ~ object(Y)
| ~ object(X) ),
inference(fof_nnf,[status(thm)],[connectedness_of_greater_than]) ).
fof(f_2_2,plain,
! [U_4,U_3] :
( U_4 = U_3
| exemplifies_relation(greater_than,U_3,U_4)
| exemplifies_relation(greater_than,U_4,U_3)
| ~ object(U_3)
| ~ object(U_4) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( U_4 = U_3
| exemplifies_relation(greater_than,U_3,U_4)
| exemplifies_relation(greater_than,U_4,U_3)
| ~ object(U_3)
| ~ object(U_4) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,negated_conjecture,
( ~ ? [X] :
( ! [Y] :
( object(Y)
=> ( exemplifies_property(none_greater,Y)
=> Y = X ) )
& exemplifies_property(none_greater,X)
& object(X) )
& ? [X] :
( exemplifies_property(none_greater,X)
& object(X) ) ),
inference(negate,[status(cth)],[lemma_2]) ).
fof(f_3_2,negated_conjecture,
( ! [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)],[f_3_1]) ).
fof(f_3_3,negated_conjecture,
( ! [U_7] :
( ? [U_6] :
( U_6 != U_7
& exemplifies_property(none_greater,U_6)
& object(U_6) )
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) )
& ? [U_5] :
( exemplifies_property(none_greater,U_5)
& object(U_5) ) ),
inference(variable_rename,[status(thm)],[f_3_2]) ).
fof(f_3_4,negated_conjecture,
( ! [U_7] :
( ? [U_6] :
( U_6 != U_7
& exemplifies_property(none_greater,U_6)
& object(U_6) )
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) )
& exemplifies_property(none_greater,sK2)
& object(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_3_3]) ).
fof(f_3_5,negated_conjecture,
( ! [U_7] :
( ( sK3(U_7) != U_7
& exemplifies_property(none_greater,sK3(U_7))
& object(sK3(U_7)) )
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) )
& exemplifies_property(none_greater,sK2)
& object(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3(U_7))],[f_3_4]) ).
fof(f_3_6,negated_conjecture,
( ! [U_7] :
( sK3(U_7) != U_7
| ~ sP0(U_7) )
& ! [U_7] :
( exemplifies_property(none_greater,sK3(U_7))
| ~ sP0(U_7) )
& ! [U_7] :
( object(sK3(U_7))
| ~ sP0(U_7) )
& ! [U_7] :
( sP0(U_7)
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) )
& exemplifies_property(none_greater,sK2)
& object(sK2) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_3_5]) ).
cnf(f_3_7,negated_conjecture,
object(sK2),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_8,negated_conjecture,
exemplifies_property(none_greater,sK2),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_9,negated_conjecture,
( sP0(U_7)
| ~ exemplifies_property(none_greater,U_7)
| ~ object(U_7) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_10,negated_conjecture,
( object(sK3(U_7))
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_11,negated_conjecture,
( exemplifies_property(none_greater,sK3(U_7))
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_3_6]) ).
cnf(f_3_12,negated_conjecture,
( sK3(U_7) != U_7
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_3_6]) ).
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) = sK1(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( sK3(Eq_x_0) = sK3(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( object(Eq_y_0)
| ~ object(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,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_8,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(equality_9,axiom,
( sP0(Eq_y_0)
| ~ sP0(Eq_x_0)
| 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 : PHI012+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.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 19 19:36:04 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------