TSTP Solution File: COM010-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM010-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 10:35:17 EDT 2023
% Result : Unsatisfiable 2.11s 1.60s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_Pair > tc_prod > c_UNITY_Omk__program > c_UNITY_OInit > c_UNITY_OAllowedActs > c_UNITY_OActs > #nlpp > tc_set > v_G > v_F > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_G,type,
v_G: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(t_a,type,
t_a: $i ).
tff(tc_prod,type,
tc_prod: ( $i * $i ) > $i ).
tff(c_UNITY_OAllowedActs,type,
c_UNITY_OAllowedActs: ( $i * $i ) > $i ).
tff(c_UNITY_Omk__program,type,
c_UNITY_Omk__program: ( $i * $i ) > $i ).
tff(c_Pair,type,
c_Pair: ( $i * $i * $i * $i ) > $i ).
tff(v_F,type,
v_F: $i ).
tff(c_UNITY_OInit,type,
c_UNITY_OInit: ( $i * $i ) > $i ).
tff(c_UNITY_OActs,type,
c_UNITY_OActs: ( $i * $i ) > $i ).
tff(f_30,axiom,
v_F != v_G,
file(unknown,unknown) ).
tff(f_32,axiom,
! [V_y,T_a] : ( c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y,T_a),c_Pair(c_UNITY_OActs(V_y,T_a),c_UNITY_OAllowedActs(V_y,T_a),tc_set(tc_set(tc_prod(T_a,T_a))),tc_set(tc_set(tc_prod(T_a,T_a)))),tc_set(T_a),tc_prod(tc_set(tc_set(tc_prod(T_a,T_a))),tc_set(tc_set(tc_prod(T_a,T_a))))),T_a) = V_y ),
file(unknown,unknown) ).
tff(f_27,axiom,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
file(unknown,unknown) ).
tff(f_26,axiom,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
file(unknown,unknown) ).
tff(f_28,axiom,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
file(unknown,unknown) ).
tff(c_8,plain,
v_G != v_F,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
! [V_y_1,T_a_2] : ( c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y_1,T_a_2),c_Pair(c_UNITY_OActs(V_y_1,T_a_2),c_UNITY_OAllowedActs(V_y_1,T_a_2),tc_set(tc_set(tc_prod(T_a_2,T_a_2))),tc_set(tc_set(tc_prod(T_a_2,T_a_2)))),tc_set(T_a_2),tc_prod(tc_set(tc_set(tc_prod(T_a_2,T_a_2))),tc_set(tc_set(tc_prod(T_a_2,T_a_2))))),T_a_2) = V_y_1 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_4,plain,
c_UNITY_OActs(v_G,t_a) = c_UNITY_OActs(v_F,t_a),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
c_UNITY_OInit(v_G,t_a) = c_UNITY_OInit(v_F,t_a),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_6,plain,
c_UNITY_OAllowedActs(v_G,t_a) = c_UNITY_OAllowedActs(v_F,t_a),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_23,plain,
! [V_y_3,T_a_4] : ( c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y_3,T_a_4),c_Pair(c_UNITY_OActs(V_y_3,T_a_4),c_UNITY_OAllowedActs(V_y_3,T_a_4),tc_set(tc_set(tc_prod(T_a_4,T_a_4))),tc_set(tc_set(tc_prod(T_a_4,T_a_4)))),tc_set(T_a_4),tc_prod(tc_set(tc_set(tc_prod(T_a_4,T_a_4))),tc_set(tc_set(tc_prod(T_a_4,T_a_4))))),T_a_4) = V_y_3 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_32,plain,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_G,t_a),c_Pair(c_UNITY_OActs(v_G,t_a),c_UNITY_OAllowedActs(v_F,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a) = v_G,
inference(superposition,[status(thm),theory(equality)],[c_6,c_23]) ).
tff(c_41,plain,
v_G = v_F,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_4,c_2,c_32]) ).
tff(c_43,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COM010-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.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:26:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.11/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.11/1.60
% 2.11/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.55/1.63
% 2.55/1.63 Inference rules
% 2.55/1.63 ----------------------
% 2.55/1.63 #Ref : 0
% 2.55/1.63 #Sup : 11
% 2.55/1.63 #Fact : 0
% 2.55/1.63 #Define : 0
% 2.55/1.63 #Split : 0
% 2.55/1.63 #Chain : 0
% 2.55/1.63 #Close : 0
% 2.55/1.63
% 2.55/1.63 Ordering : KBO
% 2.55/1.63
% 2.55/1.63 Simplification rules
% 2.55/1.63 ----------------------
% 2.55/1.63 #Subsume : 0
% 2.55/1.63 #Demod : 3
% 2.55/1.63 #Tautology : 8
% 2.55/1.63 #SimpNegUnit : 1
% 2.55/1.63 #BackRed : 0
% 2.55/1.63
% 2.55/1.63 #Partial instantiations: 0
% 2.55/1.63 #Strategies tried : 1
% 2.55/1.63
% 2.55/1.63 Timing (in seconds)
% 2.55/1.63 ----------------------
% 2.55/1.63 Preprocessing : 0.43
% 2.55/1.63 Parsing : 0.22
% 2.55/1.63 CNF conversion : 0.02
% 2.55/1.63 Main loop : 0.14
% 2.55/1.63 Inferencing : 0.06
% 2.55/1.63 Reduction : 0.04
% 2.55/1.63 Demodulation : 0.03
% 2.55/1.63 BG Simplification : 0.01
% 2.55/1.63 Subsumption : 0.02
% 2.55/1.63 Abstraction : 0.01
% 2.55/1.63 MUC search : 0.00
% 2.55/1.63 Cooper : 0.00
% 2.55/1.63 Total : 0.61
% 2.55/1.63 Index Insertion : 0.00
% 2.55/1.63 Index Deletion : 0.00
% 2.55/1.63 Index Matching : 0.00
% 2.55/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------