TSTP Solution File: SWB002+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWB002+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 : 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:12 EDT 2023
% Result : Theorem 2.39s 1.55s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 1 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 5 (; 2 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > #nlpp > uri_ex_s > uri_ex_q > uri_ex_p > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_ex_s,type,
uri_ex_s: $i ).
tff(uri_ex_p,type,
uri_ex_p: $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(uri_ex_q,type,
uri_ex_q: $i ).
tff(f_33,axiom,
? [BNODE_o] :
( iext(uri_ex_p,uri_ex_s,BNODE_o)
& iext(uri_ex_q,BNODE_o,uri_ex_s) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
tff(f_29,negated_conjecture,
~ ? [BNODE_x,BNODE_y] :
( iext(uri_ex_p,BNODE_x,BNODE_y)
& iext(uri_ex_q,BNODE_y,BNODE_x) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
tff(c_6,plain,
iext(uri_ex_p,uri_ex_s,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_4,plain,
iext(uri_ex_q,'#skF_1',uri_ex_s),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_7,plain,
! [BNODE_y_3,BNODE_x_4] :
( ~ iext(uri_ex_q,BNODE_y_3,BNODE_x_4)
| ~ iext(uri_ex_p,BNODE_x_4,BNODE_y_3) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_10,plain,
~ iext(uri_ex_p,uri_ex_s,'#skF_1'),
inference(resolution,[status(thm)],[c_4,c_7]) ).
tff(c_14,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB002+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/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.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:28:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.39/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.55
% 2.39/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.53/1.58
% 2.53/1.58 Inference rules
% 2.53/1.58 ----------------------
% 2.53/1.58 #Ref : 0
% 2.53/1.58 #Sup : 1
% 2.53/1.58 #Fact : 0
% 2.53/1.58 #Define : 0
% 2.53/1.58 #Split : 0
% 2.53/1.58 #Chain : 0
% 2.53/1.58 #Close : 0
% 2.53/1.58
% 2.53/1.58 Ordering : KBO
% 2.53/1.58
% 2.53/1.58 Simplification rules
% 2.53/1.58 ----------------------
% 2.53/1.58 #Subsume : 0
% 2.53/1.58 #Demod : 1
% 2.53/1.58 #Tautology : 0
% 2.53/1.58 #SimpNegUnit : 0
% 2.53/1.58 #BackRed : 0
% 2.53/1.58
% 2.53/1.58 #Partial instantiations: 0
% 2.53/1.58 #Strategies tried : 1
% 2.53/1.58
% 2.53/1.58 Timing (in seconds)
% 2.53/1.58 ----------------------
% 2.53/1.58 Preprocessing : 0.40
% 2.53/1.58 Parsing : 0.22
% 2.53/1.58 CNF conversion : 0.02
% 2.53/1.58 Main loop : 0.13
% 2.53/1.58 Inferencing : 0.07
% 2.53/1.58 Reduction : 0.02
% 2.53/1.58 Demodulation : 0.02
% 2.53/1.58 BG Simplification : 0.01
% 2.53/1.58 Subsumption : 0.02
% 2.53/1.58 Abstraction : 0.00
% 2.53/1.58 MUC search : 0.00
% 2.53/1.58 Cooper : 0.00
% 2.53/1.58 Total : 0.57
% 2.53/1.58 Index Insertion : 0.00
% 2.53/1.58 Index Deletion : 0.00
% 2.53/1.58 Index Matching : 0.00
% 2.53/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------