TSTP Solution File: SWB030+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB030+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 : 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 11:00:31 EDT 2023
% Result : Unsatisfiable 3.05s 1.78s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 43 ( 12 unt; 14 typ; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 27 ~; 23 |; 7 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 41 (; 40 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > icext > ic > literal_typed > #nlpp > uri_xsd_boolean > uri_rdf_type > uri_owl_onProperty > uri_owl_hasSelf > uri_owl_complementOf > uri_owl_Restriction > uri_owl_Class > uri_ex_c > dat_str_true > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_owl_complementOf,type,
uri_owl_complementOf: $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(uri_ex_c,type,
uri_ex_c: $i ).
tff(icext,type,
icext: ( $i * $i ) > $o ).
tff(uri_xsd_boolean,type,
uri_xsd_boolean: $i ).
tff(uri_owl_Restriction,type,
uri_owl_Restriction: $i ).
tff(ic,type,
ic: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(uri_owl_Class,type,
uri_owl_Class: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(uri_owl_hasSelf,type,
uri_owl_hasSelf: $i ).
tff(dat_str_true,type,
dat_str_true: $i ).
tff(f_59,axiom,
? [BNODE_x] :
( iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_owl_complementOf,uri_ex_c,BNODE_x)
& iext(uri_rdf_type,BNODE_x,uri_owl_Restriction)
& iext(uri_owl_onProperty,BNODE_x,uri_rdf_type)
& iext(uri_owl_hasSelf,BNODE_x,literal_typed(dat_str_true,uri_xsd_boolean)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_030_Bad_Class) ).
tff(f_49,axiom,
! [Z,C] :
( iext(uri_owl_complementOf,Z,C)
=> ( ic(Z)
& ic(C)
& ! [X] :
( icext(Z,X)
<=> ~ icext(C,X) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_complementof_class) ).
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_37,axiom,
! [Z,P,V] :
( ( iext(uri_owl_hasSelf,Z,V)
& iext(uri_owl_onProperty,Z,P) )
=> ! [X] :
( icext(Z,X)
<=> iext(P,X,X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_restrict_hasself) ).
tff(c_24,plain,
iext(uri_owl_complementOf,uri_ex_c,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_59,plain,
! [Z_24,X_25,C_26] :
( icext(Z_24,X_25)
| icext(C_26,X_25)
| ~ iext(uri_owl_complementOf,Z_24,C_26) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_62,plain,
! [X_25] :
( icext(uri_ex_c,X_25)
| icext('#skF_1',X_25) ),
inference(resolution,[status(thm)],[c_24,c_59]) ).
tff(c_20,plain,
iext(uri_owl_onProperty,'#skF_1',uri_rdf_type),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_4,plain,
! [X_1,C_2] :
( iext(uri_rdf_type,X_1,C_2)
| ~ icext(C_2,X_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_78,plain,
! [Z_31,X_32,P_33,V_34] :
( icext(Z_31,X_32)
| ~ iext(P_33,X_32,X_32)
| ~ iext(uri_owl_onProperty,Z_31,P_33)
| ~ iext(uri_owl_hasSelf,Z_31,V_34) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_100,plain,
! [Z_41,C_42,V_43] :
( icext(Z_41,C_42)
| ~ iext(uri_owl_onProperty,Z_41,uri_rdf_type)
| ~ iext(uri_owl_hasSelf,Z_41,V_43)
| ~ icext(C_42,C_42) ),
inference(resolution,[status(thm)],[c_4,c_78]) ).
tff(c_103,plain,
! [C_42,V_43] :
( icext('#skF_1',C_42)
| ~ iext(uri_owl_hasSelf,'#skF_1',V_43)
| ~ icext(C_42,C_42) ),
inference(resolution,[status(thm)],[c_20,c_100]) ).
tff(c_104,plain,
! [V_43] : ~ iext(uri_owl_hasSelf,'#skF_1',V_43),
inference(splitLeft,[status(thm)],[c_103]) ).
tff(c_18,plain,
iext(uri_owl_hasSelf,'#skF_1',literal_typed(dat_str_true,uri_xsd_boolean)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_106,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_104,c_18]) ).
tff(c_108,plain,
! [C_44] :
( icext('#skF_1',C_44)
| ~ icext(C_44,C_44) ),
inference(splitRight,[status(thm)],[c_103]) ).
tff(c_112,plain,
icext('#skF_1',uri_ex_c),
inference(resolution,[status(thm)],[c_62,c_108]) ).
tff(c_10,plain,
! [C_9,X_11,Z_8] :
( ~ icext(C_9,X_11)
| ~ icext(Z_8,X_11)
| ~ iext(uri_owl_complementOf,Z_8,C_9) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_125,plain,
! [Z_46] :
( ~ icext(Z_46,uri_ex_c)
| ~ iext(uri_owl_complementOf,Z_46,'#skF_1') ),
inference(resolution,[status(thm)],[c_112,c_10]) ).
tff(c_129,plain,
~ icext(uri_ex_c,uri_ex_c),
inference(resolution,[status(thm)],[c_24,c_125]) ).
tff(c_6,plain,
! [P_4,X_7,Z_3,V_5] :
( iext(P_4,X_7,X_7)
| ~ icext(Z_3,X_7)
| ~ iext(uri_owl_onProperty,Z_3,P_4)
| ~ iext(uri_owl_hasSelf,Z_3,V_5) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_120,plain,
! [P_4,V_5] :
( iext(P_4,uri_ex_c,uri_ex_c)
| ~ iext(uri_owl_onProperty,'#skF_1',P_4)
| ~ iext(uri_owl_hasSelf,'#skF_1',V_5) ),
inference(resolution,[status(thm)],[c_112,c_6]) ).
tff(c_135,plain,
! [V_5] : ~ iext(uri_owl_hasSelf,'#skF_1',V_5),
inference(splitLeft,[status(thm)],[c_120]) ).
tff(c_137,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_135,c_18]) ).
tff(c_139,plain,
! [P_47] :
( iext(P_47,uri_ex_c,uri_ex_c)
| ~ iext(uri_owl_onProperty,'#skF_1',P_47) ),
inference(splitRight,[status(thm)],[c_120]) ).
tff(c_142,plain,
iext(uri_rdf_type,uri_ex_c,uri_ex_c),
inference(resolution,[status(thm)],[c_20,c_139]) ).
tff(c_2,plain,
! [C_2,X_1] :
( icext(C_2,X_1)
| ~ iext(uri_rdf_type,X_1,C_2) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_147,plain,
icext(uri_ex_c,uri_ex_c),
inference(resolution,[status(thm)],[c_142,c_2]) ).
tff(c_152,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_129,c_147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB030+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 18:23:36 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.05/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.05/1.78
% 3.05/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.28/1.81
% 3.28/1.81 Inference rules
% 3.28/1.81 ----------------------
% 3.28/1.81 #Ref : 0
% 3.28/1.81 #Sup : 26
% 3.28/1.81 #Fact : 0
% 3.28/1.82 #Define : 0
% 3.28/1.82 #Split : 8
% 3.28/1.82 #Chain : 0
% 3.28/1.82 #Close : 0
% 3.28/1.82
% 3.28/1.82 Ordering : KBO
% 3.28/1.82
% 3.28/1.82 Simplification rules
% 3.28/1.82 ----------------------
% 3.28/1.82 #Subsume : 0
% 3.28/1.82 #Demod : 2
% 3.28/1.82 #Tautology : 3
% 3.28/1.82 #SimpNegUnit : 3
% 3.28/1.82 #BackRed : 2
% 3.28/1.82
% 3.28/1.82 #Partial instantiations: 0
% 3.28/1.82 #Strategies tried : 1
% 3.28/1.82
% 3.28/1.82 Timing (in seconds)
% 3.28/1.82 ----------------------
% 3.28/1.82 Preprocessing : 0.44
% 3.28/1.82 Parsing : 0.25
% 3.28/1.82 CNF conversion : 0.03
% 3.28/1.82 Main loop : 0.32
% 3.28/1.82 Inferencing : 0.14
% 3.28/1.82 Reduction : 0.08
% 3.28/1.82 Demodulation : 0.05
% 3.28/1.82 BG Simplification : 0.01
% 3.28/1.82 Subsumption : 0.07
% 3.28/1.82 Abstraction : 0.01
% 3.28/1.82 MUC search : 0.00
% 3.28/1.82 Cooper : 0.00
% 3.28/1.82 Total : 0.82
% 3.28/1.82 Index Insertion : 0.00
% 3.28/1.82 Index Deletion : 0.00
% 3.28/1.82 Index Matching : 0.00
% 3.28/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------