TSTP Solution File: PHI012+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : PHI012+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 12:54:47 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 103 ( 11 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 125 ( 46 ~; 52 |; 18 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn; 10 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
object: $i > $o ).
tff(decl_23,type,
none_greater: $i ).
tff(decl_24,type,
exemplifies_property: ( $i * $i ) > $o ).
tff(decl_25,type,
conceivable: $i ).
tff(decl_26,type,
greater_than: $i ).
tff(decl_27,type,
exemplifies_relation: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
esk1_1: $i > $i ).
tff(decl_29,type,
esk2_0: $i ).
tff(decl_30,type,
esk3_1: $i > $i ).
fof(lemma_2,conjecture,
( ? [X1] :
( object(X1)
& exemplifies_property(none_greater,X1) )
=> ? [X1] :
( object(X1)
& exemplifies_property(none_greater,X1)
& ! [X2] :
( object(X2)
=> ( exemplifies_property(none_greater,X2)
=> X2 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_2) ).
fof(definition_none_greater,axiom,
! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
<=> ( exemplifies_property(conceivable,X1)
& ~ ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X1)
& exemplifies_property(conceivable,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(connectedness_of_greater_than,axiom,
! [X1,X2] :
( ( object(X1)
& object(X2) )
=> ( exemplifies_relation(greater_than,X1,X2)
| exemplifies_relation(greater_than,X2,X1)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_of_greater_than) ).
fof(c_0_3,negated_conjecture,
~ ( ? [X1] :
( object(X1)
& exemplifies_property(none_greater,X1) )
=> ? [X1] :
( object(X1)
& exemplifies_property(none_greater,X1)
& ! [X2] :
( object(X2)
=> ( exemplifies_property(none_greater,X2)
=> X2 = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[lemma_2]) ).
fof(c_0_4,plain,
! [X3,X4] :
( ( exemplifies_property(conceivable,X3)
| ~ exemplifies_property(none_greater,X3)
| ~ object(X3) )
& ( ~ object(X4)
| ~ exemplifies_relation(greater_than,X4,X3)
| ~ exemplifies_property(conceivable,X4)
| ~ exemplifies_property(none_greater,X3)
| ~ object(X3) )
& ( object(esk1_1(X3))
| ~ exemplifies_property(conceivable,X3)
| exemplifies_property(none_greater,X3)
| ~ object(X3) )
& ( exemplifies_relation(greater_than,esk1_1(X3),X3)
| ~ exemplifies_property(conceivable,X3)
| exemplifies_property(none_greater,X3)
| ~ object(X3) )
& ( exemplifies_property(conceivable,esk1_1(X3))
| ~ exemplifies_property(conceivable,X3)
| exemplifies_property(none_greater,X3)
| ~ object(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_none_greater])])])])]) ).
fof(c_0_5,plain,
! [X6,X7] :
( ~ object(X6)
| ~ object(X7)
| exemplifies_relation(greater_than,X6,X7)
| exemplifies_relation(greater_than,X7,X6)
| X6 = X7 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_of_greater_than])]) ).
fof(c_0_6,negated_conjecture,
! [X9] :
( object(esk2_0)
& exemplifies_property(none_greater,esk2_0)
& ( object(esk3_1(X9))
| ~ object(X9)
| ~ exemplifies_property(none_greater,X9) )
& ( exemplifies_property(none_greater,esk3_1(X9))
| ~ object(X9)
| ~ exemplifies_property(none_greater,X9) )
& ( esk3_1(X9) != X9
| ~ object(X9)
| ~ exemplifies_property(none_greater,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_7,plain,
( ~ object(X1)
| ~ exemplifies_relation(greater_than,X1,X2)
| ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_property(none_greater,X2)
| ~ object(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( exemplifies_relation(greater_than,X1,X2)
| exemplifies_relation(greater_than,X2,X1)
| X1 = X2
| ~ object(X1)
| ~ object(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( exemplifies_property(none_greater,esk3_1(X1))
| ~ object(X1)
| ~ exemplifies_property(none_greater,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
exemplifies_property(none_greater,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
object(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( object(esk3_1(X1))
| ~ object(X1)
| ~ exemplifies_property(none_greater,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( X1 = X2
| exemplifies_relation(greater_than,X2,X1)
| ~ exemplifies_property(none_greater,X2)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X2)
| ~ object(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
exemplifies_property(none_greater,esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
object(esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_16,plain,
( exemplifies_property(conceivable,X1)
| ~ exemplifies_property(none_greater,X1)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk3_1(esk2_0)
| exemplifies_relation(greater_than,esk3_1(esk2_0),X1)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
exemplifies_property(conceivable,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11])]) ).
cnf(c_0_19,negated_conjecture,
( esk3_1(esk2_0) = esk2_0
| exemplifies_relation(greater_than,esk3_1(esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
exemplifies_property(conceivable,esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
( esk3_1(X1) != X1
| ~ object(X1)
| ~ exemplifies_property(none_greater,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
esk3_1(esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_10]),c_0_11]),c_0_15])]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI012+1 : TPTP v8.1.2. Released v7.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 08:42:49 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.59 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.007000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.61 % Total time : 0.010000 s
%------------------------------------------------------------------------------