TSTP Solution File: SWB003+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB003+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 : n025.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:13 EDT 2023
% Result : Theorem 2.15s 1.47s
% Output : CNFRefutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of formulae : 10 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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 : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > #nlpp > literal_plain > uri_ex_s > uri_ex_p > dat_str_foo
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_ex_s,type,
uri_ex_s: $i ).
tff(dat_str_foo,type,
dat_str_foo: $i ).
tff(uri_ex_p,type,
uri_ex_p: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(literal_plain,type,
literal_plain: $i > $i ).
tff(f_27,negated_conjecture,
~ ? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
tff(f_28,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
tff(c_2,plain,
! [BNODE_x_1] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x_1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_5,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% 0.14/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 : n025.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:39:19 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.15/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.15/1.47
% 2.15/1.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.35/1.51
% 2.35/1.51 Inference rules
% 2.35/1.51 ----------------------
% 2.35/1.51 #Ref : 0
% 2.35/1.51 #Sup : 0
% 2.35/1.51 #Fact : 0
% 2.35/1.51 #Define : 0
% 2.35/1.51 #Split : 0
% 2.35/1.51 #Chain : 0
% 2.35/1.51 #Close : 0
% 2.35/1.51
% 2.35/1.51 Ordering : KBO
% 2.35/1.51
% 2.35/1.51 Simplification rules
% 2.35/1.51 ----------------------
% 2.35/1.51 #Subsume : 1
% 2.35/1.51 #Demod : 0
% 2.35/1.51 #Tautology : 0
% 2.35/1.51 #SimpNegUnit : 1
% 2.35/1.51 #BackRed : 0
% 2.35/1.51
% 2.35/1.51 #Partial instantiations: 0
% 2.35/1.51 #Strategies tried : 1
% 2.35/1.51
% 2.35/1.51 Timing (in seconds)
% 2.35/1.51 ----------------------
% 2.35/1.52 Preprocessing : 0.38
% 2.35/1.52 Parsing : 0.21
% 2.35/1.52 CNF conversion : 0.02
% 2.35/1.52 Main loop : 0.05
% 2.35/1.52 Inferencing : 0.00
% 2.35/1.52 Reduction : 0.02
% 2.35/1.52 Demodulation : 0.02
% 2.35/1.52 BG Simplification : 0.01
% 2.35/1.52 Subsumption : 0.02
% 2.35/1.52 Abstraction : 0.00
% 2.35/1.52 MUC search : 0.00
% 2.35/1.52 Cooper : 0.00
% 2.35/1.52 Total : 0.49
% 2.35/1.52 Index Insertion : 0.00
% 2.35/1.52 Index Deletion : 0.00
% 2.35/1.52 Index Matching : 0.00
% 2.35/1.52 BG Taut test : 0.00
%------------------------------------------------------------------------------