TSTP Solution File: SWV257-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV257-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 : n012.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.20s 1.53s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 14 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > #nlpp > tc_set > c_Message_Oparts > c_Message_Oanalz > v_H > tc_Message_Omsg
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_Message_Oanalz,type,
c_Message_Oanalz: $i > $i ).
tff(tc_set,type,
tc_set: $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(v_H,type,
v_H: $i ).
tff(f_29,axiom,
! [V_H] : c_lessequals(V_H,c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(f_34,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_27,axiom,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_H_1] : c_lessequals(V_H_1,c_Message_Oanalz(V_H_1),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_8,plain,
! [V_G_5,V_H_6] :
( c_lessequals(c_Message_Oparts(V_G_5),c_Message_Oparts(V_H_6),tc_set(tc_Message_Omsg))
| ~ c_lessequals(V_G_5,V_H_6,tc_set(tc_Message_Omsg)) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_11,plain,
~ c_lessequals(v_H,c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)),
inference(resolution,[status(thm)],[c_8,c_2]) ).
tff(c_15,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV257-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.13/0.34 % Computer : n012.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.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:41:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.20/1.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.20/1.54
% 2.20/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.47/1.57
% 2.47/1.57 Inference rules
% 2.47/1.57 ----------------------
% 2.47/1.57 #Ref : 0
% 2.47/1.57 #Sup : 1
% 2.47/1.57 #Fact : 0
% 2.47/1.57 #Define : 0
% 2.47/1.57 #Split : 0
% 2.47/1.57 #Chain : 0
% 2.47/1.57 #Close : 0
% 2.47/1.57
% 2.47/1.57 Ordering : KBO
% 2.47/1.57
% 2.47/1.57 Simplification rules
% 2.47/1.57 ----------------------
% 2.47/1.57 #Subsume : 0
% 2.47/1.57 #Demod : 1
% 2.47/1.57 #Tautology : 0
% 2.47/1.57 #SimpNegUnit : 0
% 2.47/1.57 #BackRed : 0
% 2.47/1.57
% 2.47/1.57 #Partial instantiations: 0
% 2.47/1.57 #Strategies tried : 1
% 2.47/1.57
% 2.47/1.57 Timing (in seconds)
% 2.47/1.57 ----------------------
% 2.47/1.58 Preprocessing : 0.37
% 2.47/1.58 Parsing : 0.21
% 2.47/1.58 CNF conversion : 0.02
% 2.47/1.58 Main loop : 0.12
% 2.47/1.58 Inferencing : 0.05
% 2.47/1.58 Reduction : 0.03
% 2.47/1.58 Demodulation : 0.02
% 2.47/1.58 BG Simplification : 0.01
% 2.47/1.58 Subsumption : 0.02
% 2.47/1.58 Abstraction : 0.00
% 2.47/1.58 MUC search : 0.00
% 2.47/1.58 Cooper : 0.00
% 2.47/1.58 Total : 0.55
% 2.47/1.58 Index Insertion : 0.00
% 2.47/1.58 Index Deletion : 0.00
% 2.47/1.58 Index Matching : 0.00
% 2.47/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------