TSTP Solution File: LAT259-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT259-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 : n003.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:46:32 EDT 2023
% Result : Unsatisfiable 2.51s 1.70s
% Output : CNFRefutation 2.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 32 ( 14 unt; 13 typ; 0 def)
% Number of atoms : 29 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 6 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-4 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > c_Relation_Oantisym > c_Pair > c_Tarski_Opotype_Oorder > tc_prod > tc_Tarski_Opotype_Opotype__ext__type > #nlpp > v_r > v_cl > v_b > v_a > tc_Product__Type_Ounit > t_a > c_Tarski_OPartialOrder
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_Relation_Oantisym,type,
c_Relation_Oantisym: ( $i * $i ) > $o ).
tff(t_a,type,
t_a: $i ).
tff(v_b,type,
v_b: $i ).
tff(v_cl,type,
v_cl: $i ).
tff(tc_prod,type,
tc_prod: ( $i * $i ) > $i ).
tff(tc_Product__Type_Ounit,type,
tc_Product__Type_Ounit: $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(c_Tarski_Opotype_Oorder,type,
c_Tarski_Opotype_Oorder: ( $i * $i * $i ) > $i ).
tff(v_a,type,
v_a: $i ).
tff(v_r,type,
v_r: $i ).
tff(c_Pair,type,
c_Pair: ( $i * $i * $i * $i ) > $i ).
tff(c_Tarski_OPartialOrder,type,
c_Tarski_OPartialOrder: $i ).
tff(tc_Tarski_Opotype_Opotype__ext__type,type,
tc_Tarski_Opotype_Opotype__ext__type: ( $i * $i ) > $i ).
tff(f_29,axiom,
v_a != v_b,
file(unknown,unknown) ).
tff(f_47,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
file(unknown,unknown) ).
tff(f_46,axiom,
c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file(unknown,unknown) ).
tff(f_45,axiom,
! [V_P,T_a] :
( ~ c_in(V_P,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit))
| c_Relation_Oantisym(c_Tarski_Opotype_Oorder(V_P,T_a,tc_Product__Type_Ounit),T_a) ),
file(unknown,unknown) ).
tff(f_26,axiom,
c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file(unknown,unknown) ).
tff(f_27,axiom,
c_in(c_Pair(v_b,v_a,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file(unknown,unknown) ).
tff(f_40,axiom,
! [V_r,T_a,V_V,V_U] :
( ~ c_Relation_Oantisym(V_r,T_a)
| ~ c_in(c_Pair(V_V,V_U,T_a,T_a),V_r,tc_prod(T_a,T_a))
| ~ c_in(c_Pair(V_U,V_V,T_a,T_a),V_r,tc_prod(T_a,T_a))
| ( V_U = V_V ) ),
file(unknown,unknown) ).
tff(c_6,plain,
v_b != v_a,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_14,plain,
c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) = v_r,
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_12,plain,
c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_19,plain,
! [V_P_7,T_a_8] :
( c_Relation_Oantisym(c_Tarski_Opotype_Oorder(V_P_7,T_a_8,tc_Product__Type_Ounit),T_a_8)
| ~ c_in(V_P_7,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a_8,tc_Product__Type_Ounit)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_21,plain,
c_Relation_Oantisym(c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),t_a),
inference(resolution,[status(thm)],[c_12,c_19]) ).
tff(c_23,plain,
c_Relation_Oantisym(v_r,t_a),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_21]) ).
tff(c_2,plain,
c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_4,plain,
c_in(c_Pair(v_b,v_a,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_24,plain,
! [V_V_9,V_U_10,T_a_11,V_r_12] :
( ( V_V_9 = V_U_10 )
| ~ c_in(c_Pair(V_U_10,V_V_9,T_a_11,T_a_11),V_r_12,tc_prod(T_a_11,T_a_11))
| ~ c_in(c_Pair(V_V_9,V_U_10,T_a_11,T_a_11),V_r_12,tc_prod(T_a_11,T_a_11))
| ~ c_Relation_Oantisym(V_r_12,T_a_11) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_26,plain,
( ( v_b = v_a )
| ~ c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_Relation_Oantisym(v_r,t_a) ),
inference(resolution,[status(thm)],[c_4,c_24]) ).
tff(c_31,plain,
v_b = v_a,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_2,c_26]) ).
tff(c_33,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT259-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 : n003.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 12:57:53 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.51/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.51/1.70
% 2.51/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.72/1.73
% 2.72/1.73 Inference rules
% 2.72/1.73 ----------------------
% 2.72/1.73 #Ref : 0
% 2.72/1.73 #Sup : 5
% 2.72/1.73 #Fact : 0
% 2.72/1.73 #Define : 0
% 2.72/1.73 #Split : 0
% 2.72/1.73 #Chain : 0
% 2.72/1.73 #Close : 0
% 2.72/1.73
% 2.72/1.73 Ordering : KBO
% 2.72/1.73
% 2.72/1.73 Simplification rules
% 2.72/1.73 ----------------------
% 2.72/1.73 #Subsume : 0
% 2.72/1.73 #Demod : 3
% 2.72/1.73 #Tautology : 2
% 2.72/1.73 #SimpNegUnit : 1
% 2.72/1.73 #BackRed : 0
% 2.72/1.73
% 2.72/1.73 #Partial instantiations: 0
% 2.72/1.73 #Strategies tried : 1
% 2.72/1.73
% 2.72/1.73 Timing (in seconds)
% 2.72/1.73 ----------------------
% 2.72/1.73 Preprocessing : 0.45
% 2.72/1.73 Parsing : 0.24
% 2.72/1.73 CNF conversion : 0.02
% 2.72/1.73 Main loop : 0.15
% 2.72/1.73 Inferencing : 0.06
% 2.72/1.73 Reduction : 0.04
% 2.72/1.73 Demodulation : 0.03
% 2.72/1.73 BG Simplification : 0.01
% 2.72/1.73 Subsumption : 0.03
% 2.72/1.73 Abstraction : 0.01
% 2.72/1.73 MUC search : 0.00
% 2.72/1.73 Cooper : 0.00
% 2.72/1.73 Total : 0.64
% 2.72/1.73 Index Insertion : 0.00
% 2.72/1.73 Index Deletion : 0.00
% 2.72/1.73 Index Matching : 0.00
% 2.72/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------