TSTP Solution File: SWV258-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV258-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:23 EDT 2023
% Result : Unsatisfiable 2.61s 1.69s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 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 : 11 ( 5 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_insert > #nlpp > tc_set > c_Message_Oparts > v_X > v_H > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_X,type,
v_X: $i ).
tff(tc_set,type,
tc_set: $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(v_H,type,
v_H: $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_26,axiom,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_48,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_33,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_46,axiom,
! [V_x,V_B,T_a,V_A] :
( ~ c_in(V_x,V_B,T_a)
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| c_lessequals(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [V_G,V_H] :
( ~ c_lessequals(V_G,c_Message_Oparts(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_28,axiom,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(c_2,plain,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_12,plain,
! [V_A_9,T_a_10] : c_lessequals(V_A_9,V_A_9,tc_set(T_a_10)),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_14,plain,
! [V_G_13,V_H_14] :
( c_lessequals(V_G_13,c_Message_Oparts(V_H_14),tc_set(tc_Message_Omsg))
| ~ c_lessequals(c_Message_Oparts(V_G_13),c_Message_Oparts(V_H_14),tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_19,plain,
! [V_G_13] : c_lessequals(V_G_13,c_Message_Oparts(V_G_13),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_12,c_14]) ).
tff(c_47,plain,
! [V_x_20,V_A_21,T_a_22,V_B_23] :
( c_lessequals(c_insert(V_x_20,V_A_21,T_a_22),V_B_23,tc_set(T_a_22))
| ~ c_lessequals(V_A_21,V_B_23,tc_set(T_a_22))
| ~ c_in(V_x_20,V_B_23,T_a_22) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_26,plain,
! [V_G_16,V_H_17] :
( c_lessequals(c_Message_Oparts(V_G_16),c_Message_Oparts(V_H_17),tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G_16,c_Message_Oparts(V_H_17),tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_4,plain,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_34,plain,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_26,c_4]) ).
tff(c_50,plain,
( ~ c_lessequals(v_H,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg))
| ~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg) ),
inference(resolution,[status(thm)],[c_47,c_34]) ).
tff(c_54,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_19,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV258-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.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 22:47:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.61/1.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.61/1.69
% 2.61/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.73
% 2.78/1.73 Inference rules
% 2.78/1.73 ----------------------
% 2.78/1.73 #Ref : 0
% 2.78/1.73 #Sup : 7
% 2.78/1.73 #Fact : 0
% 2.78/1.73 #Define : 0
% 2.78/1.73 #Split : 0
% 2.78/1.73 #Chain : 0
% 2.78/1.73 #Close : 0
% 2.78/1.73
% 2.78/1.73 Ordering : KBO
% 2.78/1.73
% 2.78/1.73 Simplification rules
% 2.78/1.73 ----------------------
% 2.78/1.73 #Subsume : 0
% 2.78/1.73 #Demod : 2
% 2.78/1.73 #Tautology : 1
% 2.78/1.73 #SimpNegUnit : 0
% 2.78/1.73 #BackRed : 0
% 2.78/1.73
% 2.78/1.73 #Partial instantiations: 0
% 2.78/1.73 #Strategies tried : 1
% 2.78/1.73
% 2.78/1.73 Timing (in seconds)
% 2.78/1.73 ----------------------
% 2.78/1.73 Preprocessing : 0.44
% 2.78/1.73 Parsing : 0.24
% 2.78/1.73 CNF conversion : 0.02
% 2.78/1.73 Main loop : 0.19
% 2.78/1.73 Inferencing : 0.08
% 2.78/1.73 Reduction : 0.04
% 2.78/1.73 Demodulation : 0.03
% 2.78/1.73 BG Simplification : 0.01
% 2.78/1.73 Subsumption : 0.06
% 2.78/1.73 Abstraction : 0.01
% 2.78/1.73 MUC search : 0.00
% 2.78/1.73 Cooper : 0.00
% 2.78/1.73 Total : 0.69
% 2.78/1.73 Index Insertion : 0.00
% 2.78/1.73 Index Deletion : 0.00
% 2.78/1.73 Index Matching : 0.00
% 2.78/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------