TSTP Solution File: PHI012+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PHI012+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 : n021.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.17s 1.79s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 102 ( 15 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 135 ( 62 ~; 60 |; 7 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 29 (; 26 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ exemplifies_relation > exemplifies_property > object > #nlpp > none_greater > greater_than > conceivable > #skF_1 > #skF_2 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(object,type,
object: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(exemplifies_relation,type,
exemplifies_relation: ( $i * $i * $i ) > $o ).
tff(conceivable,type,
conceivable: $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(exemplifies_property,type,
exemplifies_property: ( $i * $i ) > $o ).
tff(greater_than,type,
greater_than: $i ).
tff(none_greater,type,
none_greater: $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(f_66,negated_conjecture,
~ ( ? [X] :
( object(X)
& exemplifies_property(none_greater,X) )
=> ? [X] :
( object(X)
& exemplifies_property(none_greater,X)
& ! [Y] :
( object(Y)
=> ( exemplifies_property(none_greater,Y)
=> ( Y = X ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_2) ).
tff(f_39,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(f_49,axiom,
! [X,Y] :
( ( object(X)
& object(Y) )
=> ( exemplifies_relation(greater_than,X,Y)
| exemplifies_relation(greater_than,Y,X)
| ( X = Y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connectedness_of_greater_than) ).
tff(c_16,plain,
object('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_14,plain,
exemplifies_property(none_greater,'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_24,plain,
! [X_10] :
( ( '#skF_3'(X_10) != X_10 )
| ~ exemplifies_property(none_greater,X_10)
| ~ object(X_10) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_27,plain,
( ( '#skF_3'('#skF_2') != '#skF_2' )
| ~ object('#skF_2') ),
inference(resolution,[status(thm)],[c_14,c_24]) ).
tff(c_30,plain,
'#skF_3'('#skF_2') != '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_16,c_27]) ).
tff(c_22,plain,
! [X_7] :
( object('#skF_3'(X_7))
| ~ exemplifies_property(none_greater,X_7)
| ~ object(X_7) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_38,plain,
! [X_12] :
( exemplifies_property(none_greater,'#skF_3'(X_12))
| ~ exemplifies_property(none_greater,X_12)
| ~ object(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_10,plain,
! [X_1] :
( exemplifies_property(conceivable,X_1)
| ~ exemplifies_property(none_greater,X_1)
| ~ object(X_1) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_45,plain,
! [X_12] :
( exemplifies_property(conceivable,'#skF_3'(X_12))
| ~ object('#skF_3'(X_12))
| ~ exemplifies_property(none_greater,X_12)
| ~ object(X_12) ),
inference(resolution,[status(thm)],[c_38,c_10]) ).
tff(c_20,plain,
! [X_7] :
( exemplifies_property(none_greater,'#skF_3'(X_7))
| ~ exemplifies_property(none_greater,X_7)
| ~ object(X_7) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_31,plain,
! [X_11] :
( exemplifies_property(conceivable,X_11)
| ~ exemplifies_property(none_greater,X_11)
| ~ object(X_11) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_34,plain,
( exemplifies_property(conceivable,'#skF_2')
| ~ object('#skF_2') ),
inference(resolution,[status(thm)],[c_14,c_31]) ).
tff(c_37,plain,
exemplifies_property(conceivable,'#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_34]) ).
tff(c_12,plain,
! [Y_6,X_5] :
( ( Y_6 = X_5 )
| exemplifies_relation(greater_than,Y_6,X_5)
| exemplifies_relation(greater_than,X_5,Y_6)
| ~ object(Y_6)
| ~ object(X_5) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_74,plain,
! [Y_21,X_22] :
( ~ exemplifies_property(conceivable,Y_21)
| ~ exemplifies_relation(greater_than,Y_21,X_22)
| ~ object(Y_21)
| ~ exemplifies_property(none_greater,X_22)
| ~ object(X_22) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_87,plain,
! [Y_23,X_24] :
( ~ exemplifies_property(conceivable,Y_23)
| ~ exemplifies_property(none_greater,X_24)
| ( Y_23 = X_24 )
| exemplifies_relation(greater_than,X_24,Y_23)
| ~ object(Y_23)
| ~ object(X_24) ),
inference(resolution,[status(thm)],[c_12,c_74]) ).
tff(c_8,plain,
! [Y_4,X_1] :
( ~ exemplifies_property(conceivable,Y_4)
| ~ exemplifies_relation(greater_than,Y_4,X_1)
| ~ object(Y_4)
| ~ exemplifies_property(none_greater,X_1)
| ~ object(X_1) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_92,plain,
! [X_25,Y_26] :
( ~ exemplifies_property(conceivable,X_25)
| ~ exemplifies_property(none_greater,Y_26)
| ~ exemplifies_property(conceivable,Y_26)
| ~ exemplifies_property(none_greater,X_25)
| ( Y_26 = X_25 )
| ~ object(Y_26)
| ~ object(X_25) ),
inference(resolution,[status(thm)],[c_87,c_8]) ).
tff(c_96,plain,
! [X_25] :
( ~ exemplifies_property(conceivable,X_25)
| ~ exemplifies_property(conceivable,'#skF_2')
| ~ exemplifies_property(none_greater,X_25)
| ( X_25 = '#skF_2' )
| ~ object('#skF_2')
| ~ object(X_25) ),
inference(resolution,[status(thm)],[c_14,c_92]) ).
tff(c_105,plain,
! [X_29] :
( ~ exemplifies_property(conceivable,X_29)
| ~ exemplifies_property(none_greater,X_29)
| ( X_29 = '#skF_2' )
| ~ object(X_29) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_37,c_96]) ).
tff(c_117,plain,
! [X_30] :
( ~ exemplifies_property(conceivable,'#skF_3'(X_30))
| ( '#skF_3'(X_30) = '#skF_2' )
| ~ object('#skF_3'(X_30))
| ~ exemplifies_property(none_greater,X_30)
| ~ object(X_30) ),
inference(resolution,[status(thm)],[c_20,c_105]) ).
tff(c_122,plain,
! [X_31] :
( ( '#skF_3'(X_31) = '#skF_2' )
| ~ object('#skF_3'(X_31))
| ~ exemplifies_property(none_greater,X_31)
| ~ object(X_31) ),
inference(resolution,[status(thm)],[c_45,c_117]) ).
tff(c_127,plain,
! [X_32] :
( ( '#skF_3'(X_32) = '#skF_2' )
| ~ exemplifies_property(none_greater,X_32)
| ~ object(X_32) ),
inference(resolution,[status(thm)],[c_22,c_122]) ).
tff(c_133,plain,
( ( '#skF_3'('#skF_2') = '#skF_2' )
| ~ object('#skF_2') ),
inference(resolution,[status(thm)],[c_14,c_127]) ).
tff(c_137,plain,
'#skF_3'('#skF_2') = '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_16,c_133]) ).
tff(c_139,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PHI012+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 : n021.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:37:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.17/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.79
% 3.17/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.17/1.82
% 3.17/1.82 Inference rules
% 3.17/1.82 ----------------------
% 3.17/1.82 #Ref : 0
% 3.17/1.82 #Sup : 18
% 3.17/1.82 #Fact : 2
% 3.17/1.82 #Define : 0
% 3.17/1.82 #Split : 0
% 3.17/1.82 #Chain : 0
% 3.17/1.82 #Close : 0
% 3.17/1.82
% 3.17/1.82 Ordering : KBO
% 3.17/1.82
% 3.17/1.82 Simplification rules
% 3.17/1.82 ----------------------
% 3.17/1.82 #Subsume : 4
% 3.17/1.82 #Demod : 7
% 3.17/1.82 #Tautology : 4
% 3.17/1.82 #SimpNegUnit : 1
% 3.17/1.82 #BackRed : 0
% 3.17/1.82
% 3.17/1.82 #Partial instantiations: 0
% 3.17/1.82 #Strategies tried : 1
% 3.17/1.82
% 3.17/1.82 Timing (in seconds)
% 3.17/1.82 ----------------------
% 3.17/1.83 Preprocessing : 0.46
% 3.17/1.83 Parsing : 0.25
% 3.17/1.83 CNF conversion : 0.03
% 3.17/1.83 Main loop : 0.29
% 3.17/1.83 Inferencing : 0.14
% 3.17/1.83 Reduction : 0.06
% 3.17/1.83 Demodulation : 0.04
% 3.17/1.83 BG Simplification : 0.02
% 3.17/1.83 Subsumption : 0.07
% 3.17/1.83 Abstraction : 0.01
% 3.17/1.83 MUC search : 0.00
% 3.17/1.83 Cooper : 0.00
% 3.17/1.83 Total : 0.80
% 3.17/1.83 Index Insertion : 0.00
% 3.17/1.83 Index Deletion : 0.00
% 3.17/1.83 Index Matching : 0.00
% 3.17/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------