TSTP Solution File: SWV264-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV264-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 : n008.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:25 EDT 2023
% Result : Unsatisfiable 2.07s 1.51s
% Output : CNFRefutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_Message_Omsg_OMPair > #nlpp > c_Message_Oparts > v_Y > v_X > v_H > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_Message_Omsg_OMPair,type,
c_Message_Omsg_OMPair: ( $i * $i ) > $i ).
tff(v_X,type,
v_X: $i ).
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_Y,type,
v_Y: $i ).
tff(v_H,type,
v_H: $i ).
tff(f_28,axiom,
~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oparts(v_H),tc_Message_Omsg),
file(unknown,unknown) ).
tff(f_33,axiom,
! [V_X,V_Y,V_H] :
( ~ c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Oparts(V_H),tc_Message_Omsg)
| c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ),
file(unknown,unknown) ).
tff(c_4,plain,
~ c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2,plain,
c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_Message_Oparts(v_H),tc_Message_Omsg),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_7,plain,
! [V_X_4,V_H_5,V_Y_6] :
( c_in(V_X_4,c_Message_Oparts(V_H_5),tc_Message_Omsg)
| ~ c_in(c_Message_Omsg_OMPair(V_X_4,V_Y_6),c_Message_Oparts(V_H_5),tc_Message_Omsg) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_10,plain,
c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg),
inference(resolution,[status(thm)],[c_2,c_7]) ).
tff(c_14,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV264-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/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.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 22:37:04 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.07/1.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.07/1.52
% 2.07/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.07/1.58
% 2.07/1.58 Inference rules
% 2.07/1.58 ----------------------
% 2.07/1.58 #Ref : 0
% 2.07/1.58 #Sup : 1
% 2.07/1.58 #Fact : 0
% 2.07/1.58 #Define : 0
% 2.07/1.58 #Split : 0
% 2.07/1.58 #Chain : 0
% 2.07/1.58 #Close : 0
% 2.07/1.58
% 2.07/1.58 Ordering : KBO
% 2.07/1.58
% 2.07/1.58 Simplification rules
% 2.07/1.58 ----------------------
% 2.07/1.58 #Subsume : 0
% 2.07/1.58 #Demod : 0
% 2.07/1.58 #Tautology : 0
% 2.07/1.58 #SimpNegUnit : 1
% 2.07/1.58 #BackRed : 0
% 2.07/1.58
% 2.07/1.58 #Partial instantiations: 0
% 2.07/1.58 #Strategies tried : 1
% 2.07/1.58
% 2.07/1.58 Timing (in seconds)
% 2.07/1.58 ----------------------
% 2.07/1.58 Preprocessing : 0.36
% 2.07/1.58 Parsing : 0.20
% 2.07/1.58 CNF conversion : 0.02
% 2.07/1.58 Main loop : 0.13
% 2.07/1.58 Inferencing : 0.06
% 2.07/1.58 Reduction : 0.03
% 2.07/1.58 Demodulation : 0.02
% 2.07/1.58 BG Simplification : 0.01
% 2.07/1.58 Subsumption : 0.02
% 2.07/1.58 Abstraction : 0.00
% 2.07/1.58 MUC search : 0.00
% 2.07/1.58 Cooper : 0.00
% 2.07/1.58 Total : 0.57
% 2.07/1.58 Index Insertion : 0.00
% 2.07/1.58 Index Deletion : 0.00
% 2.07/1.59 Index Matching : 0.00
% 2.07/1.59 BG Taut test : 0.00
%------------------------------------------------------------------------------