TSTP Solution File: SWB006+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB006+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n032.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:15 EDT 2023
% Result : Theorem 2.31s 1.53s
% Output : CNFRefutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 23 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 20 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 1 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 6 (; 5 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > #nlpp > literal_plain > uri_owl_sameAs > uri_ex_w > uri_ex_u > dat_str_abc > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_ex_u,type,
uri_ex_u: $i ).
tff(dat_str_abc,type,
dat_str_abc: $i ).
tff(uri_ex_w,type,
uri_ex_w: $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(uri_owl_sameAs,type,
uri_owl_sameAs: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(literal_plain,type,
literal_plain: $i > $i ).
tff(f_28,axiom,
! [X,Y] :
( iext(uri_owl_sameAs,X,Y)
<=> ( X = Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_eqdis_sameas) ).
tff(f_36,axiom,
? [BNODE_x] :
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,BNODE_x,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,BNODE_x,uri_ex_w) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
tff(f_30,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
tff(c_4,plain,
! [Y_2] : iext(uri_owl_sameAs,Y_2,Y_2),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_10,plain,
iext(uri_owl_sameAs,'#skF_1',literal_plain(dat_str_abc)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_14,plain,
! [Y_4,X_5] :
( ( Y_4 = X_5 )
| ~ iext(uri_owl_sameAs,X_5,Y_4) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_28,plain,
literal_plain(dat_str_abc) = '#skF_1',
inference(resolution,[status(thm)],[c_10,c_14]) ).
tff(c_12,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_27,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(resolution,[status(thm)],[c_12,c_14]) ).
tff(c_46,plain,
uri_ex_u = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_28,c_27]) ).
tff(c_8,plain,
iext(uri_owl_sameAs,'#skF_1',uri_ex_w),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_31,plain,
uri_ex_w = '#skF_1',
inference(resolution,[status(thm)],[c_8,c_14]) ).
tff(c_6,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_32,plain,
~ iext(uri_owl_sameAs,uri_ex_u,'#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_31,c_6]) ).
tff(c_51,plain,
~ iext(uri_owl_sameAs,'#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_46,c_32]) ).
tff(c_54,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWB006+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.32 % Computer : n032.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Aug 3 18:26:36 EDT 2023
% 0.12/0.32 % CPUTime :
% 2.31/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.31/1.54
% 2.31/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.31/1.56
% 2.31/1.56 Inference rules
% 2.31/1.56 ----------------------
% 2.31/1.56 #Ref : 0
% 2.31/1.56 #Sup : 10
% 2.31/1.56 #Fact : 0
% 2.31/1.56 #Define : 0
% 2.31/1.56 #Split : 0
% 2.31/1.56 #Chain : 0
% 2.31/1.56 #Close : 0
% 2.31/1.56
% 2.31/1.56 Ordering : KBO
% 2.31/1.56
% 2.31/1.56 Simplification rules
% 2.31/1.56 ----------------------
% 2.31/1.56 #Subsume : 0
% 2.31/1.56 #Demod : 9
% 2.31/1.56 #Tautology : 9
% 2.31/1.56 #SimpNegUnit : 0
% 2.31/1.56 #BackRed : 6
% 2.31/1.56
% 2.31/1.56 #Partial instantiations: 0
% 2.31/1.56 #Strategies tried : 1
% 2.31/1.56
% 2.31/1.56 Timing (in seconds)
% 2.31/1.56 ----------------------
% 2.31/1.57 Preprocessing : 0.41
% 2.31/1.57 Parsing : 0.22
% 2.31/1.57 CNF conversion : 0.02
% 2.31/1.57 Main loop : 0.15
% 2.31/1.57 Inferencing : 0.06
% 2.31/1.57 Reduction : 0.04
% 2.31/1.57 Demodulation : 0.03
% 2.31/1.57 BG Simplification : 0.01
% 2.31/1.57 Subsumption : 0.04
% 2.31/1.57 Abstraction : 0.00
% 2.31/1.57 MUC search : 0.00
% 2.31/1.57 Cooper : 0.00
% 2.31/1.57 Total : 0.61
% 2.31/1.57 Index Insertion : 0.00
% 2.31/1.57 Index Deletion : 0.00
% 2.31/1.57 Index Matching : 0.00
% 2.31/1.57 BG Taut test : 0.00
%------------------------------------------------------------------------------