TSTP Solution File: PHI014+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PHI014+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 : n015.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 2.88s 1.71s
% Output : CNFRefutation 3.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 41 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 103 ( 45 ~; 41 |; 8 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 27 (; 24 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ exemplifies_relation > is_the > exemplifies_property > property > object > #nlpp > none_greater > greater_than > god > existence > conceivable > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(object,type,
object: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $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(exemplifies_property,type,
exemplifies_property: ( $i * $i ) > $o ).
tff(greater_than,type,
greater_than: $i ).
tff(none_greater,type,
none_greater: $i ).
tff(existence,type,
existence: $i ).
tff(god,type,
god: $i ).
tff(f_77,negated_conjecture,
~ exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
tff(f_75,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_god) ).
tff(f_46,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_40,axiom,
! [F] :
( property(F)
=> ( ? [Y] :
( object(Y)
& is_the(Y,F) )
=> ! [Z] :
( object(Z)
=> ( is_the(Z,F)
=> exemplifies_property(F,Z) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).
tff(f_74,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_60,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_26,plain,
~ exemplifies_property(existence,god),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_24,plain,
is_the(god,none_greater),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_32,plain,
! [X_16,F_17] :
( object(X_16)
| ~ is_the(X_16,F_17) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_36,plain,
object(god),
inference(resolution,[status(thm)],[c_24,c_32]) ).
tff(c_27,plain,
! [F_14,X_15] :
( property(F_14)
| ~ is_the(X_15,F_14) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_31,plain,
property(none_greater),
inference(resolution,[status(thm)],[c_24,c_27]) ).
tff(c_53,plain,
! [F_27,Z_28,Y_29] :
( exemplifies_property(F_27,Z_28)
| ~ is_the(Z_28,F_27)
| ~ object(Z_28)
| ~ is_the(Y_29,F_27)
| ~ object(Y_29)
| ~ property(F_27) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_55,plain,
! [Y_29] :
( exemplifies_property(none_greater,god)
| ~ object(god)
| ~ is_the(Y_29,none_greater)
| ~ object(Y_29)
| ~ property(none_greater) ),
inference(resolution,[status(thm)],[c_24,c_53]) ).
tff(c_58,plain,
! [Y_29] :
( exemplifies_property(none_greater,god)
| ~ is_the(Y_29,none_greater)
| ~ object(Y_29) ),
inference(demodulation,[status(thm),theory(equality)],[c_31,c_36,c_55]) ).
tff(c_60,plain,
! [Y_30] :
( ~ is_the(Y_30,none_greater)
| ~ object(Y_30) ),
inference(splitLeft,[status(thm)],[c_58]) ).
tff(c_63,plain,
~ object(god),
inference(resolution,[status(thm)],[c_24,c_60]) ).
tff(c_67,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_63]) ).
tff(c_68,plain,
exemplifies_property(none_greater,god),
inference(splitRight,[status(thm)],[c_58]) ).
tff(c_22,plain,
! [X_12] :
( object('#skF_2'(X_12))
| exemplifies_property(existence,X_12)
| ~ is_the(X_12,none_greater)
| ~ object(X_12) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_18,plain,
! [X_12] :
( exemplifies_property(conceivable,'#skF_2'(X_12))
| exemplifies_property(existence,X_12)
| ~ is_the(X_12,none_greater)
| ~ object(X_12) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_20,plain,
! [X_12] :
( exemplifies_relation(greater_than,'#skF_2'(X_12),X_12)
| exemplifies_property(existence,X_12)
| ~ is_the(X_12,none_greater)
| ~ object(X_12) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_44,plain,
! [Y_25,X_26] :
( ~ exemplifies_property(conceivable,Y_25)
| ~ exemplifies_relation(greater_than,Y_25,X_26)
| ~ object(Y_25)
| ~ exemplifies_property(none_greater,X_26)
| ~ object(X_26) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_75,plain,
! [X_31] :
( ~ exemplifies_property(conceivable,'#skF_2'(X_31))
| ~ object('#skF_2'(X_31))
| ~ exemplifies_property(none_greater,X_31)
| exemplifies_property(existence,X_31)
| ~ is_the(X_31,none_greater)
| ~ object(X_31) ),
inference(resolution,[status(thm)],[c_20,c_44]) ).
tff(c_80,plain,
! [X_32] :
( ~ object('#skF_2'(X_32))
| ~ exemplifies_property(none_greater,X_32)
| exemplifies_property(existence,X_32)
| ~ is_the(X_32,none_greater)
| ~ object(X_32) ),
inference(resolution,[status(thm)],[c_18,c_75]) ).
tff(c_85,plain,
! [X_33] :
( ~ exemplifies_property(none_greater,X_33)
| exemplifies_property(existence,X_33)
| ~ is_the(X_33,none_greater)
| ~ object(X_33) ),
inference(resolution,[status(thm)],[c_22,c_80]) ).
tff(c_88,plain,
( ~ exemplifies_property(none_greater,god)
| exemplifies_property(existence,god)
| ~ object(god) ),
inference(resolution,[status(thm)],[c_24,c_85]) ).
tff(c_91,plain,
exemplifies_property(existence,god),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_68,c_88]) ).
tff(c_93,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PHI014+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.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:53:44 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.88/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.71
% 2.88/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.08/1.74
% 3.08/1.74 Inference rules
% 3.08/1.74 ----------------------
% 3.08/1.74 #Ref : 0
% 3.08/1.74 #Sup : 10
% 3.08/1.74 #Fact : 0
% 3.08/1.74 #Define : 0
% 3.08/1.74 #Split : 1
% 3.08/1.74 #Chain : 0
% 3.08/1.74 #Close : 0
% 3.08/1.74
% 3.08/1.74 Ordering : KBO
% 3.08/1.74
% 3.08/1.74 Simplification rules
% 3.08/1.74 ----------------------
% 3.08/1.74 #Subsume : 5
% 3.08/1.74 #Demod : 6
% 3.08/1.74 #Tautology : 1
% 3.08/1.74 #SimpNegUnit : 1
% 3.08/1.74 #BackRed : 0
% 3.08/1.74
% 3.08/1.74 #Partial instantiations: 0
% 3.08/1.74 #Strategies tried : 1
% 3.08/1.74
% 3.08/1.74 Timing (in seconds)
% 3.08/1.74 ----------------------
% 3.08/1.75 Preprocessing : 0.44
% 3.08/1.75 Parsing : 0.24
% 3.08/1.75 CNF conversion : 0.03
% 3.08/1.75 Main loop : 0.25
% 3.08/1.75 Inferencing : 0.12
% 3.08/1.75 Reduction : 0.05
% 3.08/1.75 Demodulation : 0.04
% 3.08/1.75 BG Simplification : 0.02
% 3.08/1.75 Subsumption : 0.06
% 3.08/1.75 Abstraction : 0.01
% 3.08/1.75 MUC search : 0.00
% 3.08/1.75 Cooper : 0.00
% 3.08/1.75 Total : 0.74
% 3.08/1.75 Index Insertion : 0.00
% 3.08/1.75 Index Deletion : 0.00
% 3.08/1.75 Index Matching : 0.00
% 3.08/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------