TSTP Solution File: SWV251-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV251-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/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 : n007.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:21 EDT 2023
% Result : Unsatisfiable 4.12s 2.05s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 40 ( 14 unt; 13 typ; 0 def)
% Number of atoms : 43 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 8 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 55 (; 55 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_union > c_minus > c_insert > #nlpp > tc_set > c_Message_Osynth > c_Message_Oanalz > v_x > v_X > v_H > v_G > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(v_X,type,
v_X: $i ).
tff(v_G,type,
v_G: $i ).
tff(c_Message_Oanalz,type,
c_Message_Oanalz: $i > $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_minus,type,
c_minus: ( $i * $i * $i ) > $i ).
tff(c_Message_Osynth,type,
c_Message_Osynth: $i > $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(tc_Message_Omsg,type,
tc_Message_Omsg: $i ).
tff(c_union,type,
c_union: ( $i * $i * $i ) > $i ).
tff(v_H,type,
v_H: $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_76,axiom,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_34,axiom,
! [V_A,V_B,T_a] : ( c_union(V_A,c_minus(V_B,V_A,tc_set(T_a)),T_a) = c_union(V_A,V_B,T_a) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [V_x,V_B,T_a,V_A] :
( ~ c_in(V_x,V_B,T_a)
| ( c_minus(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a)) = c_minus(V_A,V_B,tc_set(T_a)) ) ),
file(unknown,unknown) ).
tff(f_75,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_44,axiom,
! [V_A,V_B,T_a,V_C] :
( ~ c_lessequals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a))
| c_lessequals(V_B,V_C,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_77,axiom,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_30,axiom,
! [V_G,V_H] :
( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [V_c,V_A,T_a,V_B] :
( ~ c_in(V_c,V_A,T_a)
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| c_in(V_c,V_B,T_a) ),
file(unknown,unknown) ).
tff(f_79,axiom,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
file(unknown,unknown) ).
tff(c_22,plain,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_6,plain,
! [V_A_6,V_B_7,T_a_8] : ( c_union(V_A_6,c_minus(V_B_7,V_A_6,tc_set(T_a_8)),T_a_8) = c_union(V_A_6,V_B_7,T_a_8) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_161,plain,
! [V_x_73,V_A_74,T_a_75,V_B_76] :
( ( c_minus(c_insert(V_x_73,V_A_74,T_a_75),V_B_76,tc_set(T_a_75)) = c_minus(V_A_74,V_B_76,tc_set(T_a_75)) )
| ~ c_in(V_x_73,V_B_76,T_a_75) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_173,plain,
! [V_B_76,V_A_74,T_a_75,V_x_73] :
( ( c_union(V_B_76,c_minus(V_A_74,V_B_76,tc_set(T_a_75)),T_a_75) = c_union(V_B_76,c_insert(V_x_73,V_A_74,T_a_75),T_a_75) )
| ~ c_in(V_x_73,V_B_76,T_a_75) ),
inference(superposition,[status(thm),theory(equality)],[c_161,c_6]) ).
tff(c_179,plain,
! [V_B_76,V_x_73,V_A_74,T_a_75] :
( ( c_union(V_B_76,c_insert(V_x_73,V_A_74,T_a_75),T_a_75) = c_union(V_B_76,V_A_74,T_a_75) )
| ~ c_in(V_x_73,V_B_76,T_a_75) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_173]) ).
tff(c_20,plain,
! [V_A_32,T_a_33] : c_lessequals(V_A_32,V_A_32,tc_set(T_a_33)),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_57,plain,
! [V_B_47,V_C_48,T_a_49,V_A_50] :
( c_lessequals(V_B_47,V_C_48,tc_set(T_a_49))
| ~ c_lessequals(c_union(V_A_50,V_B_47,T_a_49),V_C_48,tc_set(T_a_49)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_68,plain,
! [V_B_47,V_A_50,T_a_33] : c_lessequals(V_B_47,c_union(V_A_50,V_B_47,T_a_33),tc_set(T_a_33)),
inference(resolution,[status(thm)],[c_20,c_57]) ).
tff(c_24,plain,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_2,plain,
! [V_G_1,V_H_2] :
( c_lessequals(c_Message_Oanalz(V_G_1),c_Message_Oanalz(V_H_2),tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G_1,V_H_2,tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_69,plain,
! [V_c_51,V_B_52,T_a_53,V_A_54] :
( c_in(V_c_51,V_B_52,T_a_53)
| ~ c_lessequals(V_A_54,V_B_52,tc_set(T_a_53))
| ~ c_in(V_c_51,V_A_54,T_a_53) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_397,plain,
! [V_c_109,V_H_110,V_G_111] :
( c_in(V_c_109,c_Message_Oanalz(V_H_110),tc_Message_Omsg)
| ~ c_in(V_c_109,c_Message_Oanalz(V_G_111),tc_Message_Omsg)
| ~ c_lessequals(V_G_111,V_H_110,tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_2,c_69]) ).
tff(c_1191,plain,
! [V_H_145] :
( c_in(v_x,c_Message_Oanalz(V_H_145),tc_Message_Omsg)
| ~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),V_H_145,tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_24,c_397]) ).
tff(c_1252,plain,
! [V_A_147] : c_in(v_x,c_Message_Oanalz(c_union(V_A_147,c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),
inference(resolution,[status(thm)],[c_68,c_1191]) ).
tff(c_1586,plain,
! [V_B_154] :
( c_in(v_x,c_Message_Oanalz(c_union(V_B_154,v_H,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(v_X,V_B_154,tc_Message_Omsg) ),
inference(superposition,[status(thm),theory(equality)],[c_179,c_1252]) ).
tff(c_26,plain,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_1591,plain,
~ c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
inference(resolution,[status(thm)],[c_1586,c_26]) ).
tff(c_1616,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_1591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV251-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.15 % 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.37 % Computer : n007.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 22:32:24 EDT 2023
% 0.14/0.37 % CPUTime :
% 4.12/2.05 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.12/2.05
% 4.12/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.12/2.09
% 4.12/2.09 Inference rules
% 4.12/2.09 ----------------------
% 4.12/2.09 #Ref : 0
% 4.12/2.09 #Sup : 397
% 4.12/2.09 #Fact : 0
% 4.12/2.09 #Define : 0
% 4.12/2.09 #Split : 0
% 4.12/2.09 #Chain : 0
% 4.12/2.09 #Close : 0
% 4.12/2.09
% 4.12/2.09 Ordering : KBO
% 4.12/2.09
% 4.12/2.09 Simplification rules
% 4.12/2.09 ----------------------
% 4.12/2.09 #Subsume : 24
% 4.12/2.09 #Demod : 232
% 4.12/2.09 #Tautology : 209
% 4.12/2.09 #SimpNegUnit : 0
% 4.12/2.09 #BackRed : 0
% 4.12/2.09
% 4.12/2.09 #Partial instantiations: 0
% 4.12/2.09 #Strategies tried : 1
% 4.12/2.09
% 4.12/2.09 Timing (in seconds)
% 4.12/2.09 ----------------------
% 4.12/2.09 Preprocessing : 0.44
% 4.12/2.09 Parsing : 0.25
% 4.12/2.09 CNF conversion : 0.02
% 4.12/2.09 Main loop : 0.56
% 4.12/2.09 Inferencing : 0.22
% 4.12/2.09 Reduction : 0.17
% 4.12/2.09 Demodulation : 0.13
% 4.12/2.09 BG Simplification : 0.03
% 4.12/2.09 Subsumption : 0.11
% 4.12/2.10 Abstraction : 0.03
% 4.12/2.10 MUC search : 0.00
% 4.12/2.10 Cooper : 0.00
% 4.12/2.10 Total : 1.06
% 4.12/2.10 Index Insertion : 0.00
% 4.12/2.10 Index Deletion : 0.00
% 4.12/2.10 Index Matching : 0.00
% 4.12/2.10 BG Taut test : 0.00
%------------------------------------------------------------------------------