TSTP Solution File: SWV263-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV263-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 : n020.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 2.56s 1.59s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 11 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > #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_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(f_27,axiom,
c_in(v_X,v_G,tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_26,axiom,
c_lessequals(v_G,v_H,tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(f_42,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_34,axiom,
! [V_X,V_H] :
( ~ c_in(V_X,V_H,tc_Message_Omsg)
| c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ),
file(unknown,unknown) ).
tff(f_29,axiom,
~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file(unknown,unknown) ).
tff(c_4,plain,
c_in(v_X,v_G,tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
c_lessequals(v_G,v_H,tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_16,plain,
! [V_c_9,V_B_10,T_a_11,V_A_12] :
( c_in(V_c_9,V_B_10,T_a_11)
| ~ c_lessequals(V_A_12,V_B_10,tc_set(T_a_11))
| ~ c_in(V_c_9,V_A_12,T_a_11) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_20,plain,
! [V_c_13] :
( c_in(V_c_13,v_H,tc_Message_Omsg)
| ~ c_in(V_c_13,v_G,tc_Message_Omsg) ),
inference(resolution,[status(thm)],[c_2,c_16]) ).
tff(c_11,plain,
! [V_X_7,V_H_8] :
( c_in(V_X_7,c_Message_Oparts(V_H_8),tc_Message_Omsg)
| ~ c_in(V_X_7,V_H_8,tc_Message_Omsg) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_6,plain,
~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_15,plain,
~ c_in(v_X,v_H,tc_Message_Omsg),
inference(resolution,[status(thm)],[c_11,c_6]) ).
tff(c_23,plain,
~ c_in(v_X,v_G,tc_Message_Omsg),
inference(resolution,[status(thm)],[c_20,c_15]) ).
tff(c_27,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV263-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/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.15/0.36 % Computer : n020.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:56:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.56/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.56/1.60
% 2.56/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.67/1.62
% 2.67/1.62 Inference rules
% 2.67/1.62 ----------------------
% 2.67/1.62 #Ref : 0
% 2.67/1.62 #Sup : 3
% 2.67/1.62 #Fact : 0
% 2.67/1.62 #Define : 0
% 2.67/1.62 #Split : 0
% 2.67/1.62 #Chain : 0
% 2.67/1.62 #Close : 0
% 2.67/1.62
% 2.67/1.62 Ordering : KBO
% 2.67/1.62
% 2.67/1.62 Simplification rules
% 2.67/1.62 ----------------------
% 2.67/1.62 #Subsume : 0
% 2.67/1.62 #Demod : 1
% 2.67/1.62 #Tautology : 0
% 2.67/1.62 #SimpNegUnit : 0
% 2.67/1.62 #BackRed : 0
% 2.67/1.62
% 2.67/1.62 #Partial instantiations: 0
% 2.67/1.62 #Strategies tried : 1
% 2.67/1.62
% 2.67/1.62 Timing (in seconds)
% 2.67/1.62 ----------------------
% 2.67/1.63 Preprocessing : 0.39
% 2.67/1.63 Parsing : 0.21
% 2.67/1.63 CNF conversion : 0.02
% 2.67/1.63 Main loop : 0.15
% 2.67/1.63 Inferencing : 0.08
% 2.67/1.63 Reduction : 0.03
% 2.67/1.63 Demodulation : 0.02
% 2.67/1.63 BG Simplification : 0.01
% 2.67/1.63 Subsumption : 0.03
% 2.67/1.63 Abstraction : 0.00
% 2.67/1.63 MUC search : 0.00
% 2.67/1.63 Cooper : 0.00
% 2.67/1.63 Total : 0.59
% 2.67/1.63 Index Insertion : 0.00
% 2.67/1.63 Index Deletion : 0.00
% 2.67/1.63 Index Matching : 0.00
% 2.67/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------