TSTP Solution File: PHI015+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PHI015+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n008.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 : Tue Aug 22 10:53:31 EDT 2023
% Result : Theorem 3.83s 1.93s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of formulae : 52 ( 14 unt; 17 typ; 0 def)
% Number of atoms : 104 ( 11 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 118 ( 49 ~; 46 |; 14 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 11 >; 14 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 31 (; 27 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ exemplifies_relation > is_the > exemplifies_property > property > object > #nlpp > none_greater > greater_than > god > existence > conceivable > #skF_7 > #skF_5 > #skF_1 > #skF_2 > #skF_6 > #skF_4 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(object,type,
object: $i > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(exemplifies_relation,type,
exemplifies_relation: ( $i * $i * $i ) > $o ).
tff(conceivable,type,
conceivable: $i ).
tff(property,type,
property: $i > $o ).
tff(is_the,type,
is_the: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(exemplifies_property,type,
exemplifies_property: ( $i * $i ) > $o ).
tff(greater_than,type,
greater_than: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i * $i ) > $i ).
tff(none_greater,type,
none_greater: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(existence,type,
existence: $i ).
tff(god,type,
god: $i ).
tff(f_133,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_god) ).
tff(f_42,axiom,
! [X,F] :
( is_the(X,F)
=> ( property(F)
& object(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
tff(f_90,axiom,
! [F,X,W] :
( ( property(F)
& object(X)
& object(W) )
=> ( ( is_the(X,F)
& ( X = W ) )
<=> ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> ( Z = Y ) ) )
& ( Y = W ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_identity_instance) ).
tff(f_118,axiom,
? [X] :
( object(X)
& exemplifies_property(none_greater,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_1) ).
tff(f_135,negated_conjecture,
~ exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
tff(f_132,axiom,
! [X] :
( object(X)
=> ( ( is_the(X,none_greater)
& ~ exemplifies_property(existence,X) )
=> ? [Y] :
( object(Y)
& exemplifies_relation(greater_than,Y,X)
& exemplifies_property(conceivable,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).
tff(f_114,axiom,
! [X] :
( object(X)
=> ( exemplifies_property(none_greater,X)
<=> ( exemplifies_property(conceivable,X)
& ~ ? [Y] :
( object(Y)
& exemplifies_relation(greater_than,Y,X)
& exemplifies_property(conceivable,Y) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_none_greater) ).
tff(c_74,plain,
is_the(god,none_greater),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_78,plain,
! [X_41,F_42] :
( object(X_41)
| ~ is_the(X_41,F_42) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_82,plain,
object(god),
inference(resolution,[status(thm)],[c_74,c_78]) ).
tff(c_83,plain,
! [F_43,X_44] :
( property(F_43)
| ~ is_the(X_44,F_43) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_87,plain,
property(none_greater),
inference(resolution,[status(thm)],[c_74,c_83]) ).
tff(c_137,plain,
! [F_55,X_56] :
( ( '#skF_3'(F_55,X_56,X_56) = X_56 )
| ~ is_the(X_56,F_55)
| ~ object(X_56)
| ~ property(F_55) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_139,plain,
( ( '#skF_3'(none_greater,god,god) = god )
| ~ object(god)
| ~ property(none_greater) ),
inference(resolution,[status(thm)],[c_74,c_137]) ).
tff(c_142,plain,
'#skF_3'(none_greater,god,god) = god,
inference(demodulation,[status(thm),theory(equality)],[c_87,c_82,c_139]) ).
tff(c_66,plain,
object('#skF_6'),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_64,plain,
exemplifies_property(none_greater,'#skF_6'),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_265,plain,
! [Z_69,F_70,X_71] :
( ( Z_69 = '#skF_3'(F_70,X_71,X_71) )
| ~ exemplifies_property(F_70,Z_69)
| ~ object(Z_69)
| ~ is_the(X_71,F_70)
| ~ object(X_71)
| ~ property(F_70) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_281,plain,
! [X_71] :
( ( '#skF_3'(none_greater,X_71,X_71) = '#skF_6' )
| ~ object('#skF_6')
| ~ is_the(X_71,none_greater)
| ~ object(X_71)
| ~ property(none_greater) ),
inference(resolution,[status(thm)],[c_64,c_265]) ).
tff(c_304,plain,
! [X_72] :
( ( '#skF_3'(none_greater,X_72,X_72) = '#skF_6' )
| ~ is_the(X_72,none_greater)
| ~ object(X_72) ),
inference(demodulation,[status(thm),theory(equality)],[c_87,c_66,c_281]) ).
tff(c_306,plain,
( ( '#skF_3'(none_greater,god,god) = '#skF_6' )
| ~ object(god) ),
inference(resolution,[status(thm)],[c_74,c_304]) ).
tff(c_309,plain,
god = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_82,c_142,c_306]) ).
tff(c_76,plain,
~ exemplifies_property(existence,god),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_315,plain,
~ exemplifies_property(existence,'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_309,c_76]) ).
tff(c_316,plain,
is_the('#skF_6',none_greater),
inference(demodulation,[status(thm),theory(equality)],[c_309,c_74]) ).
tff(c_72,plain,
! [X_38] :
( object('#skF_7'(X_38))
| exemplifies_property(existence,X_38)
| ~ is_the(X_38,none_greater)
| ~ object(X_38) ),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_68,plain,
! [X_38] :
( exemplifies_property(conceivable,'#skF_7'(X_38))
| exemplifies_property(existence,X_38)
| ~ is_the(X_38,none_greater)
| ~ object(X_38) ),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_70,plain,
! [X_38] :
( exemplifies_relation(greater_than,'#skF_7'(X_38),X_38)
| exemplifies_property(existence,X_38)
| ~ is_the(X_38,none_greater)
| ~ object(X_38) ),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_211,plain,
! [Y_62,X_63] :
( ~ exemplifies_property(conceivable,Y_62)
| ~ exemplifies_relation(greater_than,Y_62,X_63)
| ~ object(Y_62)
| ~ exemplifies_property(none_greater,X_63)
| ~ object(X_63) ),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_429,plain,
! [X_98] :
( ~ exemplifies_property(conceivable,'#skF_7'(X_98))
| ~ object('#skF_7'(X_98))
| ~ exemplifies_property(none_greater,X_98)
| exemplifies_property(existence,X_98)
| ~ is_the(X_98,none_greater)
| ~ object(X_98) ),
inference(resolution,[status(thm)],[c_70,c_211]) ).
tff(c_434,plain,
! [X_99] :
( ~ object('#skF_7'(X_99))
| ~ exemplifies_property(none_greater,X_99)
| exemplifies_property(existence,X_99)
| ~ is_the(X_99,none_greater)
| ~ object(X_99) ),
inference(resolution,[status(thm)],[c_68,c_429]) ).
tff(c_439,plain,
! [X_100] :
( ~ exemplifies_property(none_greater,X_100)
| exemplifies_property(existence,X_100)
| ~ is_the(X_100,none_greater)
| ~ object(X_100) ),
inference(resolution,[status(thm)],[c_72,c_434]) ).
tff(c_442,plain,
( ~ exemplifies_property(none_greater,'#skF_6')
| exemplifies_property(existence,'#skF_6')
| ~ object('#skF_6') ),
inference(resolution,[status(thm)],[c_316,c_439]) ).
tff(c_445,plain,
exemplifies_property(existence,'#skF_6'),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_64,c_442]) ).
tff(c_447,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_315,c_445]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PHI015+1 : TPTP v8.1.2. Released v7.2.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:39:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.83/1.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.83/1.93
% 3.83/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.83/1.96
% 3.83/1.96 Inference rules
% 3.83/1.96 ----------------------
% 3.83/1.96 #Ref : 0
% 3.83/1.96 #Sup : 69
% 3.83/1.96 #Fact : 2
% 3.83/1.96 #Define : 0
% 3.83/1.96 #Split : 0
% 3.83/1.96 #Chain : 0
% 3.83/1.96 #Close : 0
% 3.83/1.96
% 3.83/1.96 Ordering : KBO
% 3.83/1.96
% 3.83/1.96 Simplification rules
% 3.83/1.96 ----------------------
% 3.83/1.96 #Subsume : 15
% 3.83/1.96 #Demod : 78
% 3.83/1.96 #Tautology : 32
% 3.83/1.96 #SimpNegUnit : 1
% 3.83/1.96 #BackRed : 6
% 3.83/1.96
% 3.83/1.96 #Partial instantiations: 0
% 3.83/1.96 #Strategies tried : 1
% 3.83/1.96
% 3.83/1.96 Timing (in seconds)
% 3.83/1.96 ----------------------
% 3.83/1.96 Preprocessing : 0.53
% 3.83/1.97 Parsing : 0.27
% 3.83/1.97 CNF conversion : 0.04
% 3.83/1.97 Main loop : 0.39
% 3.83/1.97 Inferencing : 0.14
% 3.83/1.97 Reduction : 0.11
% 3.83/1.97 Demodulation : 0.07
% 3.83/1.97 BG Simplification : 0.03
% 3.83/1.97 Subsumption : 0.09
% 3.83/1.97 Abstraction : 0.02
% 3.83/1.97 MUC search : 0.00
% 3.83/1.97 Cooper : 0.00
% 3.83/1.97 Total : 0.97
% 3.83/1.97 Index Insertion : 0.00
% 3.83/1.97 Index Deletion : 0.00
% 3.83/1.97 Index Matching : 0.00
% 3.83/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------