TSTP Solution File: SWB017+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB017+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 : n012.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:24 EDT 2023
% Result : Theorem 3.10s 1.80s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 9 unt; 11 typ; 0 def)
% Number of atoms : 26 ( 3 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 21 ( 10 ~; 4 |; 5 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > ip > #nlpp > uri_rdf_type > uri_owl_propertyDisjointWith > uri_owl_differentFrom > uri_ex_w > uri_ex_u > uri_ex_notInstanceOf > uri_ex_c > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_rdf_type,type,
uri_rdf_type: $i ).
tff(uri_ex_u,type,
uri_ex_u: $i ).
tff(uri_ex_c,type,
uri_ex_c: $i ).
tff(uri_owl_propertyDisjointWith,type,
uri_owl_propertyDisjointWith: $i ).
tff(ip,type,
ip: $i > $o ).
tff(uri_ex_notInstanceOf,type,
uri_ex_notInstanceOf: $i ).
tff(uri_owl_differentFrom,type,
uri_owl_differentFrom: $i ).
tff(uri_ex_w,type,
uri_ex_w: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_48,axiom,
( iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c)
& iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_017_Built_in_Based_Definitions) ).
tff(f_29,axiom,
! [X,Y] :
( iext(uri_owl_differentFrom,X,Y)
<=> ( X != Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_differentfrom) ).
tff(f_43,negated_conjecture,
~ iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_017_Built_in_Based_Definitions) ).
tff(f_41,axiom,
! [P1,P2] :
( iext(uri_owl_propertyDisjointWith,P1,P2)
<=> ( ip(P1)
& ip(P2)
& ! [X,Y] :
~ ( iext(P1,X,Y)
& iext(P2,X,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_propertydisjointwith) ).
tff(c_22,plain,
iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_18,plain,
iext(uri_ex_notInstanceOf,uri_ex_u,uri_ex_c),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_24,plain,
! [X_12,Y_13] :
( iext(uri_owl_differentFrom,X_12,Y_13)
| ( Y_13 = X_12 ) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_16,plain,
~ iext(uri_owl_differentFrom,uri_ex_w,uri_ex_u),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_34,plain,
uri_ex_w = uri_ex_u,
inference(resolution,[status(thm)],[c_24,c_16]) ).
tff(c_20,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_36,plain,
iext(uri_rdf_type,uri_ex_u,uri_ex_c),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_20]) ).
tff(c_51,plain,
! [P2_18,X_19,Y_20,P1_21] :
( ~ iext(P2_18,X_19,Y_20)
| ~ iext(P1_21,X_19,Y_20)
| ~ iext(uri_owl_propertyDisjointWith,P1_21,P2_18) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_113,plain,
! [P1_28] :
( ~ iext(P1_28,uri_ex_u,uri_ex_c)
| ~ iext(uri_owl_propertyDisjointWith,P1_28,uri_rdf_type) ),
inference(resolution,[status(thm)],[c_36,c_51]) ).
tff(c_120,plain,
~ iext(uri_owl_propertyDisjointWith,uri_ex_notInstanceOf,uri_rdf_type),
inference(resolution,[status(thm)],[c_18,c_113]) ).
tff(c_126,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWB017+2 : TPTP v8.1.2. Released v5.2.0.
% 0.12/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 : n012.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 18:22:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.10/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.80
% 3.10/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.10/1.83
% 3.10/1.83 Inference rules
% 3.10/1.83 ----------------------
% 3.10/1.83 #Ref : 0
% 3.10/1.83 #Sup : 24
% 3.10/1.83 #Fact : 0
% 3.10/1.83 #Define : 0
% 3.10/1.83 #Split : 2
% 3.10/1.83 #Chain : 0
% 3.10/1.83 #Close : 0
% 3.10/1.83
% 3.10/1.83 Ordering : KBO
% 3.10/1.83
% 3.10/1.83 Simplification rules
% 3.10/1.83 ----------------------
% 3.10/1.83 #Subsume : 1
% 3.10/1.83 #Demod : 3
% 3.10/1.83 #Tautology : 3
% 3.10/1.83 #SimpNegUnit : 0
% 3.10/1.83 #BackRed : 2
% 3.10/1.83
% 3.10/1.83 #Partial instantiations: 0
% 3.10/1.83 #Strategies tried : 1
% 3.10/1.83
% 3.10/1.83 Timing (in seconds)
% 3.10/1.83 ----------------------
% 3.10/1.83 Preprocessing : 0.45
% 3.10/1.83 Parsing : 0.24
% 3.10/1.83 CNF conversion : 0.03
% 3.10/1.83 Main loop : 0.26
% 3.10/1.83 Inferencing : 0.11
% 3.10/1.83 Reduction : 0.06
% 3.10/1.83 Demodulation : 0.05
% 3.10/1.83 BG Simplification : 0.02
% 3.10/1.83 Subsumption : 0.06
% 3.10/1.83 Abstraction : 0.01
% 3.10/1.83 MUC search : 0.00
% 3.10/1.83 Cooper : 0.00
% 3.10/1.83 Total : 0.76
% 3.10/1.83 Index Insertion : 0.00
% 3.10/1.83 Index Deletion : 0.00
% 3.10/1.83 Index Matching : 0.00
% 3.10/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------