TSTP Solution File: SWV239-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV239-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 : 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:03:17 EDT 2023
% Result : Unsatisfiable 2.62s 1.70s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_union > c_Main_OsubsetI__1 > #nlpp > tc_set > c_Message_Oanalz > v_H > v_G > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
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_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_union,type,
c_union: ( $i * $i * $i ) > $i ).
tff(v_H,type,
v_H: $i ).
tff(f_44,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_32,axiom,
! [V_X,V_H] :
( ~ c_in(V_X,c_Message_Oanalz(c_Message_Oanalz(V_H)),tc_Message_Omsg)
| c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ),
file(unknown,unknown) ).
tff(f_49,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_51,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_40,axiom,
! [V_H,V_H_H,V_G,V_G_H] :
( ~ c_lessequals(c_Message_Oanalz(V_H),c_Message_Oanalz(V_H_H),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_G_H),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(V_G_H,V_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(c_16,plain,
! [V_A_22,V_B_23,T_a_24] :
( c_lessequals(V_A_22,V_B_23,tc_set(T_a_24))
| c_in(c_Main_OsubsetI__1(V_A_22,V_B_23,T_a_24),V_A_22,T_a_24) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_4,plain,
! [V_X_1,V_H_2] :
( c_in(V_X_1,c_Message_Oanalz(V_H_2),tc_Message_Omsg)
| ~ c_in(V_X_1,c_Message_Oanalz(c_Message_Oanalz(V_H_2)),tc_Message_Omsg) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_36,plain,
! [V_H_29,V_B_30] :
( c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(V_H_29)),V_B_30,tc_Message_Omsg),c_Message_Oanalz(V_H_29),tc_Message_Omsg)
| c_lessequals(c_Message_Oanalz(c_Message_Oanalz(V_H_29)),V_B_30,tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_16,c_4]) ).
tff(c_10,plain,
! [V_A_10,V_B_11,T_a_12] :
( c_lessequals(V_A_10,V_B_11,tc_set(T_a_12))
| ~ c_in(c_Main_OsubsetI__1(V_A_10,V_B_11,T_a_12),V_B_11,T_a_12) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_44,plain,
! [V_H_29] : c_lessequals(c_Message_Oanalz(c_Message_Oanalz(V_H_29)),c_Message_Oanalz(V_H_29),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_36,c_10]) ).
tff(c_12,plain,
! [V_A_13,T_a_14] : c_lessequals(V_A_13,V_A_13,tc_set(T_a_14)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_28,plain,
! [V_G_25,V_H_26,V_G_H_27,V_H_H_28] :
( c_lessequals(c_Message_Oanalz(c_union(V_G_25,V_H_26,tc_Message_Omsg)),c_Message_Oanalz(c_union(V_G_H_27,V_H_H_28,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(V_G_25),c_Message_Oanalz(V_G_H_27),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(V_H_26),c_Message_Oanalz(V_H_H_28),tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_2,plain,
~ c_lessequals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_31,plain,
( ~ c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oanalz(v_H),c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_28,c_2]) ).
tff(c_34,plain,
~ c_lessequals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg)),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_31]) ).
tff(c_48,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV239-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.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.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 23:08:19 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.62/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.62/1.71
% 2.62/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.89/1.73
% 2.89/1.73 Inference rules
% 2.89/1.73 ----------------------
% 2.89/1.73 #Ref : 0
% 2.89/1.73 #Sup : 5
% 2.89/1.73 #Fact : 0
% 2.89/1.73 #Define : 0
% 2.89/1.73 #Split : 0
% 2.89/1.73 #Chain : 0
% 2.89/1.73 #Close : 0
% 2.89/1.73
% 2.89/1.73 Ordering : KBO
% 2.89/1.73
% 2.89/1.73 Simplification rules
% 2.89/1.73 ----------------------
% 2.89/1.74 #Subsume : 0
% 2.89/1.74 #Demod : 3
% 2.89/1.74 #Tautology : 1
% 2.89/1.74 #SimpNegUnit : 0
% 2.89/1.74 #BackRed : 1
% 2.89/1.74
% 2.89/1.74 #Partial instantiations: 0
% 2.89/1.74 #Strategies tried : 1
% 2.89/1.74
% 2.89/1.74 Timing (in seconds)
% 2.89/1.74 ----------------------
% 2.89/1.74 Preprocessing : 0.42
% 2.89/1.74 Parsing : 0.24
% 2.89/1.74 CNF conversion : 0.02
% 2.89/1.74 Main loop : 0.18
% 2.89/1.74 Inferencing : 0.09
% 2.89/1.74 Reduction : 0.04
% 2.89/1.74 Demodulation : 0.03
% 2.89/1.74 BG Simplification : 0.01
% 2.89/1.74 Subsumption : 0.04
% 2.89/1.74 Abstraction : 0.01
% 2.89/1.74 MUC search : 0.00
% 2.89/1.74 Cooper : 0.00
% 2.89/1.74 Total : 0.65
% 2.89/1.74 Index Insertion : 0.00
% 2.89/1.74 Index Deletion : 0.00
% 2.89/1.74 Index Matching : 0.00
% 2.89/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------