TSTP Solution File: SWV262-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV262-2 : TPTP v8.1.2. Released v3.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 : n029.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:03:24 EDT 2023
% Result : Unsatisfiable 2.38s 1.65s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_union > c_insert > #nlpp > c_Message_Oparts > v_Y > v_X > v_H > tc_Message_Omsg > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_X,type,
v_X: $i ).
tff(c_emptyset,type,
c_emptyset: $i ).
tff(tc_Message_Omsg,type,
tc_Message_Omsg: $i ).
tff(c_Message_Oparts,type,
c_Message_Oparts: $i > $i ).
tff(c_union,type,
c_union: ( $i * $i * $i ) > $i ).
tff(v_Y,type,
v_Y: $i ).
tff(v_H,type,
v_H: $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_31,axiom,
! [V_y,T_a] : ( c_union(c_emptyset,V_y,T_a) = V_y ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [V_a,V_B,T_a,V_C] : ( c_union(c_insert(V_a,V_B,T_a),V_C,T_a) = c_insert(V_a,c_union(V_B,V_C,T_a),T_a) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [V_G,V_H] : ( c_Message_Oparts(c_union(V_G,V_H,tc_Message_Omsg)) = c_union(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_Message_Omsg) ),
file(unknown,unknown) ).
tff(f_27,axiom,
c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg),
file(unknown,unknown) ).
tff(c_6,plain,
! [V_y_3,T_a_4] : ( c_union(c_emptyset,V_y_3,T_a_4) = V_y_3 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_8,plain,
! [V_a_5,V_B_6,T_a_7,V_C_8] : ( c_union(c_insert(V_a_5,V_B_6,T_a_7),V_C_8,T_a_7) = c_insert(V_a_5,c_union(V_B_6,V_C_8,T_a_7),T_a_7) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_4,plain,
! [V_G_1,V_H_2] : ( c_union(c_Message_Oparts(V_G_1),c_Message_Oparts(V_H_2),tc_Message_Omsg) = c_Message_Oparts(c_union(V_G_1,V_H_2,tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg) != c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_10,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_8,c_4,c_6,c_8,c_4,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV262-2 : TPTP v8.1.2. Released v3.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 : n029.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.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 23:28:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.38/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.38/1.66
% 2.38/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.59/1.68
% 2.59/1.68 Inference rules
% 2.59/1.68 ----------------------
% 2.59/1.68 #Ref : 0
% 2.59/1.68 #Sup : 0
% 2.59/1.68 #Fact : 0
% 2.59/1.68 #Define : 0
% 2.59/1.68 #Split : 0
% 2.59/1.68 #Chain : 0
% 2.59/1.68 #Close : 0
% 2.59/1.68
% 2.59/1.68 Ordering : KBO
% 2.59/1.68
% 2.59/1.68 Simplification rules
% 2.59/1.68 ----------------------
% 2.59/1.68 #Subsume : 3
% 2.59/1.68 #Demod : 7
% 2.59/1.68 #Tautology : 0
% 2.59/1.68 #SimpNegUnit : 0
% 2.59/1.68 #BackRed : 0
% 2.59/1.68
% 2.59/1.68 #Partial instantiations: 0
% 2.59/1.68 #Strategies tried : 1
% 2.59/1.68
% 2.59/1.68 Timing (in seconds)
% 2.59/1.68 ----------------------
% 2.60/1.69 Preprocessing : 0.42
% 2.60/1.69 Parsing : 0.23
% 2.60/1.69 CNF conversion : 0.02
% 2.60/1.69 Main loop : 0.06
% 2.60/1.69 Inferencing : 0.00
% 2.60/1.69 Reduction : 0.03
% 2.60/1.69 Demodulation : 0.03
% 2.60/1.69 BG Simplification : 0.01
% 2.60/1.69 Subsumption : 0.02
% 2.60/1.69 Abstraction : 0.00
% 2.60/1.69 MUC search : 0.00
% 2.60/1.69 Cooper : 0.00
% 2.60/1.69 Total : 0.52
% 2.60/1.69 Index Insertion : 0.00
% 2.60/1.69 Index Deletion : 0.00
% 2.60/1.69 Index Matching : 0.00
% 2.60/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------