TSTP Solution File: SWV273-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV273-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 : n015.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:28 EDT 2023
% Result : Unsatisfiable 2.80s 1.80s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 24 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_union > #nlpp > tc_set > c_Message_Osynth > c_Message_Oparts > v_H > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_Message_Osynth,type,
c_Message_Osynth: $i > $i ).
tff(c_lessequals,type,
c_lessequals: ( $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(f_39,axiom,
! [V_H] : c_lessequals(V_H,c_Message_Osynth(V_H),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(f_32,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_49,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_37,axiom,
! [V_G,V_H] :
( ~ c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))
| c_lessequals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [V_B,V_C,T_a,V_A] :
( ~ c_lessequals(V_B,V_C,tc_set(T_a))
| ~ c_lessequals(V_A,V_C,tc_set(T_a))
| c_lessequals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(c_8,plain,
! [V_H_5] : c_lessequals(V_H_5,c_Message_Osynth(V_H_5),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
! [V_G_1,V_H_2] :
( c_lessequals(c_Message_Oparts(V_G_1),c_Message_Oparts(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_32]) ).
tff(c_12,plain,
! [V_A_10,T_a_11] : c_lessequals(V_A_10,V_A_10,tc_set(T_a_11)),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_16,plain,
! [V_G_17,V_H_18] :
( c_lessequals(V_G_17,c_Message_Oparts(V_H_18),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(V_G_17),c_Message_Oparts(V_H_18),tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_25,plain,
! [V_G_17] : c_lessequals(V_G_17,c_Message_Oparts(V_G_17),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_12,c_16]) ).
tff(c_26,plain,
! [V_A_19,V_B_20,T_a_21,V_C_22] :
( c_lessequals(c_union(V_A_19,V_B_20,T_a_21),V_C_22,tc_set(T_a_21))
| ~ c_lessequals(V_A_19,V_C_22,tc_set(T_a_21))
| ~ c_lessequals(V_B_20,V_C_22,tc_set(T_a_21)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_2,plain,
~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_30,plain,
( ~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Osynth(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)) ),
inference(resolution,[status(thm)],[c_26,c_2]) ).
tff(c_84,plain,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_30]) ).
tff(c_90,plain,
~ c_lessequals(v_H,c_Message_Osynth(v_H),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_4,c_84]) ).
tff(c_95,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWV273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/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.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 23:33:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.80/1.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.80/1.80
% 2.80/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.96/1.84
% 2.96/1.84 Inference rules
% 2.96/1.84 ----------------------
% 2.96/1.84 #Ref : 0
% 2.96/1.84 #Sup : 14
% 2.96/1.84 #Fact : 0
% 2.96/1.84 #Define : 0
% 2.96/1.84 #Split : 0
% 2.96/1.84 #Chain : 0
% 2.96/1.84 #Close : 0
% 2.96/1.84
% 2.96/1.84 Ordering : KBO
% 2.96/1.84
% 2.96/1.84 Simplification rules
% 2.96/1.84 ----------------------
% 2.96/1.84 #Subsume : 1
% 2.96/1.84 #Demod : 3
% 2.96/1.84 #Tautology : 0
% 2.96/1.84 #SimpNegUnit : 0
% 2.96/1.84 #BackRed : 0
% 2.96/1.84
% 2.96/1.84 #Partial instantiations: 0
% 2.96/1.84 #Strategies tried : 1
% 2.96/1.84
% 2.96/1.84 Timing (in seconds)
% 2.96/1.84 ----------------------
% 2.96/1.84 Preprocessing : 0.44
% 2.96/1.84 Parsing : 0.25
% 2.96/1.84 CNF conversion : 0.02
% 2.96/1.84 Main loop : 0.22
% 2.96/1.84 Inferencing : 0.10
% 2.96/1.84 Reduction : 0.06
% 2.96/1.84 Demodulation : 0.04
% 2.96/1.84 BG Simplification : 0.01
% 2.96/1.84 Subsumption : 0.05
% 2.96/1.84 Abstraction : 0.01
% 2.96/1.84 MUC search : 0.00
% 2.96/1.84 Cooper : 0.00
% 2.96/1.84 Total : 0.72
% 2.96/1.84 Index Insertion : 0.00
% 2.96/1.84 Index Deletion : 0.00
% 2.96/1.84 Index Matching : 0.00
% 2.96/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------