TSTP Solution File: SWB024+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB024+2 : TPTP v8.1.2. Released v5.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 : n026.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 11:00:27 EDT 2023
% Result : Theorem 4.20s 2.07s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 29
% Syntax : Number of formulae : 50 ( 11 unt; 23 typ; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 69 ( 27 ~; 22 |; 13 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 10 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 34 (; 31 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > icext > ip > ic > literal_typed > #nlpp > uri_xsd_nonNegativeInteger > uri_rdfs_subClassOf > uri_rdf_type > uri_owl_onProperty > uri_owl_minCardinality > uri_owl_TransitiveProperty > uri_owl_Restriction > uri_ex_hasAncestor > uri_ex_bob > uri_ex_alice > uri_ex_Person > dat_str_1 > #skF_5 > #skF_1 > #skF_4 > #skF_6 > #skF_3 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(uri_rdf_type,type,
uri_rdf_type: $i ).
tff(uri_owl_onProperty,type,
uri_owl_onProperty: $i ).
tff(literal_typed,type,
literal_typed: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(uri_ex_Person,type,
uri_ex_Person: $i ).
tff(uri_ex_bob,type,
uri_ex_bob: $i ).
tff(icext,type,
icext: ( $i * $i ) > $o ).
tff(ip,type,
ip: $i > $o ).
tff(uri_ex_hasAncestor,type,
uri_ex_hasAncestor: $i ).
tff(uri_owl_TransitiveProperty,type,
uri_owl_TransitiveProperty: $i ).
tff(uri_owl_Restriction,type,
uri_owl_Restriction: $i ).
tff(uri_ex_alice,type,
uri_ex_alice: $i ).
tff(ic,type,
ic: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(uri_rdfs_subClassOf,type,
uri_rdfs_subClassOf: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(dat_str_1,type,
dat_str_1: $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(uri_xsd_nonNegativeInteger,type,
uri_xsd_nonNegativeInteger: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(uri_owl_minCardinality,type,
uri_owl_minCardinality: $i ).
tff(f_81,axiom,
? [BNODE_z] :
( iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty)
& iext(uri_rdfs_subClassOf,uri_ex_Person,BNODE_z)
& iext(uri_rdf_type,BNODE_z,uri_owl_Restriction)
& iext(uri_owl_onProperty,BNODE_z,uri_ex_hasAncestor)
& iext(uri_owl_minCardinality,BNODE_z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
& iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
& iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).
tff(f_28,axiom,
! [X,C] :
( iext(uri_rdf_type,X,C)
<=> icext(C,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).
tff(f_49,axiom,
! [C1,C2] :
( iext(uri_rdfs_subClassOf,C1,C2)
<=> ( ic(C1)
& ic(C2)
& ! [X] :
( icext(C1,X)
=> icext(C2,X) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_rdfsext_subclassof) ).
tff(f_38,axiom,
! [Z,P] :
( ( iext(uri_owl_minCardinality,Z,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_owl_onProperty,Z,P) )
=> ! [X] :
( icext(Z,X)
<=> ? [Y] : iext(P,X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_restrict_mincard_001) ).
tff(f_60,axiom,
! [P] :
( icext(uri_owl_TransitiveProperty,P)
<=> ( ip(P)
& ! [X,Y,Z] :
( ( iext(P,X,Y)
& iext(P,Y,Z) )
=> iext(P,X,Z) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_char_transitive) ).
tff(f_65,negated_conjecture,
~ ? [BNODE_x] :
( iext(uri_ex_hasAncestor,uri_ex_bob,BNODE_x)
& iext(uri_ex_hasAncestor,uri_ex_alice,BNODE_x) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).
tff(c_40,plain,
iext(uri_owl_onProperty,'#skF_6',uri_ex_hasAncestor),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_44,plain,
iext(uri_rdfs_subClassOf,uri_ex_Person,'#skF_6'),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_34,plain,
iext(uri_rdf_type,uri_ex_bob,uri_ex_Person),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_59,plain,
! [C_36,X_37] :
( icext(C_36,X_37)
| ~ iext(uri_rdf_type,X_37,C_36) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_72,plain,
icext(uri_ex_Person,uri_ex_bob),
inference(resolution,[status(thm)],[c_34,c_59]) ).
tff(c_85,plain,
! [C2_40,X_41,C1_42] :
( icext(C2_40,X_41)
| ~ icext(C1_42,X_41)
| ~ iext(uri_rdfs_subClassOf,C1_42,C2_40) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_123,plain,
! [C2_46] :
( icext(C2_46,uri_ex_bob)
| ~ iext(uri_rdfs_subClassOf,uri_ex_Person,C2_46) ),
inference(resolution,[status(thm)],[c_72,c_85]) ).
tff(c_127,plain,
icext('#skF_6',uri_ex_bob),
inference(resolution,[status(thm)],[c_44,c_123]) ).
tff(c_46,plain,
iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_75,plain,
icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor),
inference(resolution,[status(thm)],[c_46,c_59]) ).
tff(c_32,plain,
iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_38,plain,
iext(uri_owl_minCardinality,'#skF_6',literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_318,plain,
! [P_66,X_67,Z_68] :
( iext(P_66,X_67,'#skF_1'(Z_68,P_66,X_67))
| ~ icext(Z_68,X_67)
| ~ iext(uri_owl_onProperty,Z_68,P_66)
| ~ iext(uri_owl_minCardinality,Z_68,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_391,plain,
! [P_79,X_80] :
( iext(P_79,X_80,'#skF_1'('#skF_6',P_79,X_80))
| ~ icext('#skF_6',X_80)
| ~ iext(uri_owl_onProperty,'#skF_6',P_79) ),
inference(resolution,[status(thm)],[c_38,c_318]) ).
tff(c_20,plain,
! [P_19,X_26,Z_28,Y_27] :
( iext(P_19,X_26,Z_28)
| ~ iext(P_19,Y_27,Z_28)
| ~ iext(P_19,X_26,Y_27)
| ~ icext(uri_owl_TransitiveProperty,P_19) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_577,plain,
! [P_112,X_113,X_114] :
( iext(P_112,X_113,'#skF_1'('#skF_6',P_112,X_114))
| ~ iext(P_112,X_113,X_114)
| ~ icext(uri_owl_TransitiveProperty,P_112)
| ~ icext('#skF_6',X_114)
| ~ iext(uri_owl_onProperty,'#skF_6',P_112) ),
inference(resolution,[status(thm)],[c_391,c_20]) ).
tff(c_30,plain,
! [BNODE_x_29] :
( ~ iext(uri_ex_hasAncestor,uri_ex_alice,BNODE_x_29)
| ~ iext(uri_ex_hasAncestor,uri_ex_bob,BNODE_x_29) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_438,plain,
( ~ iext(uri_ex_hasAncestor,uri_ex_alice,'#skF_1'('#skF_6',uri_ex_hasAncestor,uri_ex_bob))
| ~ icext('#skF_6',uri_ex_bob)
| ~ iext(uri_owl_onProperty,'#skF_6',uri_ex_hasAncestor) ),
inference(resolution,[status(thm)],[c_391,c_30]) ).
tff(c_455,plain,
~ iext(uri_ex_hasAncestor,uri_ex_alice,'#skF_1'('#skF_6',uri_ex_hasAncestor,uri_ex_bob)),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_127,c_438]) ).
tff(c_586,plain,
( ~ iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob)
| ~ icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor)
| ~ icext('#skF_6',uri_ex_bob)
| ~ iext(uri_owl_onProperty,'#skF_6',uri_ex_hasAncestor) ),
inference(resolution,[status(thm)],[c_577,c_455]) ).
tff(c_639,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_127,c_75,c_32,c_586]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWB024+2 : TPTP v8.1.2. Released v5.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.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 18:38:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.20/2.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.20/2.07
% 4.20/2.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.20/2.10
% 4.20/2.10 Inference rules
% 4.20/2.10 ----------------------
% 4.20/2.10 #Ref : 0
% 4.20/2.10 #Sup : 128
% 4.20/2.10 #Fact : 0
% 4.20/2.10 #Define : 0
% 4.20/2.10 #Split : 12
% 4.20/2.10 #Chain : 0
% 4.20/2.10 #Close : 0
% 4.20/2.10
% 4.20/2.10 Ordering : KBO
% 4.20/2.10
% 4.20/2.10 Simplification rules
% 4.20/2.10 ----------------------
% 4.20/2.10 #Subsume : 33
% 4.20/2.10 #Demod : 34
% 4.20/2.10 #Tautology : 19
% 4.20/2.10 #SimpNegUnit : 4
% 4.20/2.10 #BackRed : 0
% 4.20/2.10
% 4.20/2.10 #Partial instantiations: 0
% 4.20/2.10 #Strategies tried : 1
% 4.20/2.10
% 4.20/2.10 Timing (in seconds)
% 4.20/2.10 ----------------------
% 4.20/2.10 Preprocessing : 0.50
% 4.20/2.10 Parsing : 0.27
% 4.20/2.10 CNF conversion : 0.04
% 4.20/2.10 Main loop : 0.54
% 4.20/2.10 Inferencing : 0.23
% 4.20/2.10 Reduction : 0.13
% 4.20/2.10 Demodulation : 0.09
% 4.20/2.10 BG Simplification : 0.02
% 4.20/2.10 Subsumption : 0.12
% 4.20/2.10 Abstraction : 0.02
% 4.20/2.10 MUC search : 0.00
% 4.20/2.10 Cooper : 0.00
% 4.20/2.10 Total : 1.08
% 4.20/2.10 Index Insertion : 0.00
% 4.20/2.11 Index Deletion : 0.00
% 4.20/2.11 Index Matching : 0.00
% 4.20/2.11 BG Taut test : 0.00
%------------------------------------------------------------------------------