TSTP Solution File: PHI009+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PHI009+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 : n011.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:30 EDT 2023
% Result : Theorem 3.80s 2.44s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 102 ( 12 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 138 ( 58 ~; 63 |; 9 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 6 >; 7 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 38 (; 35 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_the > exemplifies_property > property > object > #nlpp > #skF_1 > #skF_2 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(object,type,
object: $i > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $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_3',type,
'#skF_3': $i ).
tff(exemplifies_property,type,
exemplifies_property: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_69,negated_conjecture,
~ ! [F] :
( property(F)
=> ( ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> ( Z = Y ) ) ) )
=> ? [U] :
( object(U)
& is_the(U,F) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_1) ).
tff(f_49,axiom,
! [F,G,X] :
( ( property(F)
& property(G)
& object(X) )
=> ( ( is_the(X,F)
& exemplifies_property(G,X) )
<=> ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> ( Z = Y ) ) )
& exemplifies_property(G,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_schema_instance) ).
tff(c_28,plain,
object('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_30,plain,
property('#skF_3'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_26,plain,
exemplifies_property('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_12,plain,
! [F_1,G_2,X_3,Y_12] :
( object('#skF_2'(F_1,G_2,X_3,Y_12))
| is_the(X_3,F_1)
| ~ exemplifies_property(G_2,Y_12)
| ~ exemplifies_property(F_1,Y_12)
| ~ object(Y_12)
| ~ object(X_3)
| ~ property(G_2)
| ~ property(F_1) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_93,plain,
! [F_60,G_61,X_62,Y_63] :
( exemplifies_property(F_60,'#skF_2'(F_60,G_61,X_62,Y_63))
| is_the(X_62,F_60)
| ~ exemplifies_property(G_61,Y_63)
| ~ exemplifies_property(F_60,Y_63)
| ~ object(Y_63)
| ~ object(X_62)
| ~ property(G_61)
| ~ property(F_60) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_24,plain,
! [Z_19] :
( ( Z_19 = '#skF_4' )
| ~ exemplifies_property('#skF_3',Z_19)
| ~ object(Z_19) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_99,plain,
! [G_61,X_62,Y_63] :
( ( '#skF_2'('#skF_3',G_61,X_62,Y_63) = '#skF_4' )
| ~ object('#skF_2'('#skF_3',G_61,X_62,Y_63))
| is_the(X_62,'#skF_3')
| ~ exemplifies_property(G_61,Y_63)
| ~ exemplifies_property('#skF_3',Y_63)
| ~ object(Y_63)
| ~ object(X_62)
| ~ property(G_61)
| ~ property('#skF_3') ),
inference(resolution,[status(thm)],[c_93,c_24]) ).
tff(c_255,plain,
! [G_79,X_80,Y_81] :
( ( '#skF_2'('#skF_3',G_79,X_80,Y_81) = '#skF_4' )
| ~ object('#skF_2'('#skF_3',G_79,X_80,Y_81))
| is_the(X_80,'#skF_3')
| ~ exemplifies_property(G_79,Y_81)
| ~ exemplifies_property('#skF_3',Y_81)
| ~ object(Y_81)
| ~ object(X_80)
| ~ property(G_79) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_99]) ).
tff(c_266,plain,
! [G_2,X_3,Y_12] :
( ( '#skF_2'('#skF_3',G_2,X_3,Y_12) = '#skF_4' )
| is_the(X_3,'#skF_3')
| ~ exemplifies_property(G_2,Y_12)
| ~ exemplifies_property('#skF_3',Y_12)
| ~ object(Y_12)
| ~ object(X_3)
| ~ property(G_2)
| ~ property('#skF_3') ),
inference(resolution,[status(thm)],[c_12,c_255]) ).
tff(c_275,plain,
! [G_82,X_83,Y_84] :
( ( '#skF_2'('#skF_3',G_82,X_83,Y_84) = '#skF_4' )
| is_the(X_83,'#skF_3')
| ~ exemplifies_property(G_82,Y_84)
| ~ exemplifies_property('#skF_3',Y_84)
| ~ object(Y_84)
| ~ object(X_83)
| ~ property(G_82) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_266]) ).
tff(c_287,plain,
! [X_83] :
( ( '#skF_2'('#skF_3','#skF_3',X_83,'#skF_4') = '#skF_4' )
| is_the(X_83,'#skF_3')
| ~ exemplifies_property('#skF_3','#skF_4')
| ~ object('#skF_4')
| ~ object(X_83)
| ~ property('#skF_3') ),
inference(resolution,[status(thm)],[c_26,c_275]) ).
tff(c_298,plain,
! [X_85] :
( ( '#skF_2'('#skF_3','#skF_3',X_85,'#skF_4') = '#skF_4' )
| is_the(X_85,'#skF_3')
| ~ object(X_85) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_28,c_26,c_287]) ).
tff(c_22,plain,
! [U_20] :
( ~ is_the(U_20,'#skF_3')
| ~ object(U_20) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_309,plain,
! [X_86] :
( ( '#skF_2'('#skF_3','#skF_3',X_86,'#skF_4') = '#skF_4' )
| ~ object(X_86) ),
inference(resolution,[status(thm)],[c_298,c_22]) ).
tff(c_325,plain,
'#skF_2'('#skF_3','#skF_3','#skF_4','#skF_4') = '#skF_4',
inference(resolution,[status(thm)],[c_28,c_309]) ).
tff(c_8,plain,
! [F_1,G_2,X_3,Y_12] :
( ( '#skF_2'(F_1,G_2,X_3,Y_12) != Y_12 )
| is_the(X_3,F_1)
| ~ exemplifies_property(G_2,Y_12)
| ~ exemplifies_property(F_1,Y_12)
| ~ object(Y_12)
| ~ object(X_3)
| ~ property(G_2)
| ~ property(F_1) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_339,plain,
( is_the('#skF_4','#skF_3')
| ~ exemplifies_property('#skF_3','#skF_4')
| ~ object('#skF_4')
| ~ property('#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_325,c_8]) ).
tff(c_356,plain,
is_the('#skF_4','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_28,c_26,c_339]) ).
tff(c_365,plain,
~ object('#skF_4'),
inference(resolution,[status(thm)],[c_356,c_22]) ).
tff(c_372,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_365]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PHI009+1 : TPTP v8.1.2. Released v7.2.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:37:51 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.80/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.19/2.45
% 4.19/2.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.38/2.50
% 4.38/2.50 Inference rules
% 4.38/2.50 ----------------------
% 4.38/2.50 #Ref : 0
% 4.38/2.50 #Sup : 68
% 4.38/2.50 #Fact : 0
% 4.38/2.50 #Define : 0
% 4.38/2.50 #Split : 0
% 4.38/2.50 #Chain : 0
% 4.38/2.50 #Close : 0
% 4.38/2.50
% 4.38/2.50 Ordering : KBO
% 4.38/2.50
% 4.38/2.50 Simplification rules
% 4.38/2.50 ----------------------
% 4.38/2.50 #Subsume : 17
% 4.38/2.50 #Demod : 103
% 4.38/2.50 #Tautology : 15
% 4.38/2.50 #SimpNegUnit : 0
% 4.38/2.50 #BackRed : 0
% 4.38/2.50
% 4.38/2.50 #Partial instantiations: 0
% 4.38/2.50 #Strategies tried : 1
% 4.38/2.50
% 4.38/2.50 Timing (in seconds)
% 4.38/2.50 ----------------------
% 4.38/2.50 Preprocessing : 0.63
% 4.38/2.50 Parsing : 0.33
% 4.38/2.50 CNF conversion : 0.05
% 4.38/2.50 Main loop : 0.57
% 4.38/2.50 Inferencing : 0.25
% 4.38/2.50 Reduction : 0.12
% 4.38/2.50 Demodulation : 0.09
% 4.38/2.50 BG Simplification : 0.04
% 4.38/2.50 Subsumption : 0.14
% 4.38/2.50 Abstraction : 0.02
% 4.38/2.50 MUC search : 0.00
% 4.38/2.50 Cooper : 0.00
% 4.38/2.50 Total : 1.28
% 4.38/2.50 Index Insertion : 0.00
% 4.38/2.50 Index Deletion : 0.00
% 4.38/2.51 Index Matching : 0.00
% 4.38/2.51 BG Taut test : 0.00
%------------------------------------------------------------------------------