TSTP Solution File: SWV261-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV261-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 : n006.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 5.75s 2.51s
% Output : CNFRefutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 42 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 58 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 23 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 7 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 74 (; 74 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_union > c_insert > c_Main_OsubsetI__1 > #nlpp > tc_set > c_Message_Oparts > v_X > v_H > v_G > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_X,type,
v_X: $i ).
tff(v_G,type,
v_G: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_Main_OsubsetI__1,type,
c_Main_OsubsetI__1: ( $i * $i * $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_Message_Oparts,type,
c_Message_Oparts: $i > $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_30,axiom,
! [V_G,V_H] : c_lessequals(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),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(f_35,axiom,
! [V_G,V_H] :
( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ),
file(unknown,unknown) ).
tff(f_69,axiom,
! [V_B,V_C,T_a,V_A] :
( ~ c_lessequals(V_B,V_C,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| c_lessequals(V_A,V_C,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_28,axiom,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(v_X,v_G,tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_56,axiom,
! [V_A,V_B,T_a] :
( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)
| c_lessequals(V_A,V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [V_a,V_b,V_A,T_a] :
( ~ c_in(V_a,c_insert(V_b,V_A,T_a),T_a)
| c_in(V_a,V_A,T_a)
| ( V_a = V_b ) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [V_c,V_B,T_a,V_A] :
( ~ c_in(V_c,V_B,T_a)
| c_in(V_c,c_union(V_A,V_B,T_a),T_a) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [V_A,V_B,T_a] :
( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)
| c_lessequals(V_A,V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [V_c,V_A,T_a,V_B] :
( ~ c_in(V_c,V_A,T_a)
| c_in(V_c,c_union(V_A,V_B,T_a),T_a) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [V_G_1,V_H_2] : c_lessequals(c_Message_Oparts(c_union(V_G_1,V_H_2,tc_Message_Omsg)),c_union(c_Message_Oparts(V_G_1),c_Message_Oparts(V_H_2),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_8,plain,
! [V_G_3,V_H_4] :
( c_lessequals(c_Message_Oparts(V_G_3),c_Message_Oparts(V_H_4),tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G_3,V_H_4,tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_47,plain,
! [V_A_51,V_C_52,T_a_53,V_B_54] :
( c_lessequals(V_A_51,V_C_52,tc_set(T_a_53))
| ~ c_lessequals(V_A_51,V_B_54,tc_set(T_a_53))
| ~ c_lessequals(V_B_54,V_C_52,tc_set(T_a_53)) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_73,plain,
! [V_G_59,V_C_60,V_H_61] :
( c_lessequals(c_Message_Oparts(V_G_59),V_C_60,tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(V_H_61),V_C_60,tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G_59,V_H_61,tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_8,c_47]) ).
tff(c_1283,plain,
! [V_G_199,V_G_200,V_H_201] :
( c_lessequals(c_Message_Oparts(V_G_199),c_union(c_Message_Oparts(V_G_200),c_Message_Oparts(V_H_201),tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G_199,c_union(V_G_200,V_H_201,tc_Message_Omsg),tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_6,c_73]) ).
tff(c_4,plain,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_1309,plain,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_1283,c_4]) ).
tff(c_2,plain,
c_in(v_X,v_G,tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_16,plain,
! [V_A_17,V_B_18,T_a_19] :
( c_lessequals(V_A_17,V_B_18,tc_set(T_a_19))
| c_in(c_Main_OsubsetI__1(V_A_17,V_B_18,T_a_19),V_A_17,T_a_19) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_39,plain,
! [V_b_45,V_a_46,V_A_47,T_a_48] :
( ( V_b_45 = V_a_46 )
| c_in(V_a_46,V_A_47,T_a_48)
| ~ c_in(V_a_46,c_insert(V_b_45,V_A_47,T_a_48),T_a_48) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_653,plain,
! [V_b_151,V_A_152,T_a_153,V_B_154] :
( ( c_Main_OsubsetI__1(c_insert(V_b_151,V_A_152,T_a_153),V_B_154,T_a_153) = V_b_151 )
| c_in(c_Main_OsubsetI__1(c_insert(V_b_151,V_A_152,T_a_153),V_B_154,T_a_153),V_A_152,T_a_153)
| c_lessequals(c_insert(V_b_151,V_A_152,T_a_153),V_B_154,tc_set(T_a_153)) ),
inference(resolution,[status(thm)],[c_16,c_39]) ).
tff(c_10,plain,
! [V_c_5,V_A_8,V_B_6,T_a_7] :
( c_in(V_c_5,c_union(V_A_8,V_B_6,T_a_7),T_a_7)
| ~ c_in(V_c_5,V_B_6,T_a_7) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_23,plain,
! [V_A_35,V_B_36,T_a_37] :
( c_lessequals(V_A_35,V_B_36,tc_set(T_a_37))
| ~ c_in(c_Main_OsubsetI__1(V_A_35,V_B_36,T_a_37),V_B_36,T_a_37) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_30,plain,
! [V_A_35,V_A_8,V_B_6,T_a_7] :
( c_lessequals(V_A_35,c_union(V_A_8,V_B_6,T_a_7),tc_set(T_a_7))
| ~ c_in(c_Main_OsubsetI__1(V_A_35,c_union(V_A_8,V_B_6,T_a_7),T_a_7),V_B_6,T_a_7) ),
inference(resolution,[status(thm)],[c_10,c_23]) ).
tff(c_2821,plain,
! [V_b_310,V_A_311,T_a_312,V_A_313] :
( ( c_Main_OsubsetI__1(c_insert(V_b_310,V_A_311,T_a_312),c_union(V_A_313,V_A_311,T_a_312),T_a_312) = V_b_310 )
| c_lessequals(c_insert(V_b_310,V_A_311,T_a_312),c_union(V_A_313,V_A_311,T_a_312),tc_set(T_a_312)) ),
inference(resolution,[status(thm)],[c_653,c_30]) ).
tff(c_2836,plain,
c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X,
inference(resolution,[status(thm)],[c_2821,c_1309]) ).
tff(c_12,plain,
! [V_c_9,V_A_10,V_B_12,T_a_11] :
( c_in(V_c_9,c_union(V_A_10,V_B_12,T_a_11),T_a_11)
| ~ c_in(V_c_9,V_A_10,T_a_11) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_31,plain,
! [V_A_35,V_A_10,V_B_12,T_a_11] :
( c_lessequals(V_A_35,c_union(V_A_10,V_B_12,T_a_11),tc_set(T_a_11))
| ~ c_in(c_Main_OsubsetI__1(V_A_35,c_union(V_A_10,V_B_12,T_a_11),T_a_11),V_A_10,T_a_11) ),
inference(resolution,[status(thm)],[c_12,c_23]) ).
tff(c_2851,plain,
( c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg))
| ~ c_in(v_X,v_G,tc_Message_Omsg) ),
inference(superposition,[status(thm),theory(equality)],[c_2836,c_31]) ).
tff(c_2864,plain,
c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2851]) ).
tff(c_2866,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1309,c_2864]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV261-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 22:38:58 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.75/2.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.03/2.52
% 6.03/2.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.03/2.55
% 6.03/2.55 Inference rules
% 6.03/2.55 ----------------------
% 6.03/2.55 #Ref : 0
% 6.03/2.55 #Sup : 646
% 6.03/2.55 #Fact : 2
% 6.03/2.55 #Define : 0
% 6.03/2.55 #Split : 1
% 6.03/2.55 #Chain : 0
% 6.03/2.55 #Close : 0
% 6.03/2.55
% 6.03/2.55 Ordering : KBO
% 6.03/2.55
% 6.03/2.55 Simplification rules
% 6.03/2.55 ----------------------
% 6.03/2.55 #Subsume : 10
% 6.03/2.55 #Demod : 64
% 6.03/2.55 #Tautology : 56
% 6.03/2.55 #SimpNegUnit : 4
% 6.03/2.55 #BackRed : 1
% 6.03/2.55
% 6.03/2.55 #Partial instantiations: 0
% 6.03/2.55 #Strategies tried : 1
% 6.03/2.55
% 6.03/2.55 Timing (in seconds)
% 6.03/2.55 ----------------------
% 6.03/2.56 Preprocessing : 0.44
% 6.03/2.56 Parsing : 0.24
% 6.03/2.56 CNF conversion : 0.02
% 6.03/2.56 Main loop : 0.98
% 6.03/2.56 Inferencing : 0.35
% 6.03/2.56 Reduction : 0.26
% 6.03/2.56 Demodulation : 0.19
% 6.03/2.56 BG Simplification : 0.03
% 6.03/2.56 Subsumption : 0.27
% 6.03/2.56 Abstraction : 0.03
% 6.03/2.56 MUC search : 0.00
% 6.03/2.56 Cooper : 0.00
% 6.03/2.56 Total : 1.46
% 6.03/2.56 Index Insertion : 0.00
% 6.03/2.56 Index Deletion : 0.00
% 6.03/2.56 Index Matching : 0.00
% 6.03/2.56 BG Taut test : 0.00
%------------------------------------------------------------------------------