TSTP Solution File: LAT266-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT266-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 : n011.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:34 EDT 2023
% Result : Unsatisfiable 2.39s 1.60s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 20 ( 11 unt; 9 typ; 0 def)
% Number of atoms : 11 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 4 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_Tarski_Opotype_Opset > c_Tarski_Odual > #nlpp > tc_set > v_cl > v_S > v_A > tc_Product__Type_Ounit > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_S,type,
v_S: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_Tarski_Opotype_Opset,type,
c_Tarski_Opotype_Opset: ( $i * $i * $i ) > $i ).
tff(c_Tarski_Odual,type,
c_Tarski_Odual: ( $i * $i ) > $i ).
tff(t_a,type,
t_a: $i ).
tff(v_cl,type,
v_cl: $i ).
tff(tc_Product__Type_Ounit,type,
tc_Product__Type_Ounit: $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(v_A,type,
v_A: $i ).
tff(f_29,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file(unknown,unknown) ).
tff(f_31,axiom,
! [V_cl,T_a] : ( c_Tarski_Opotype_Opset(c_Tarski_Odual(V_cl,T_a),T_a,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(V_cl,T_a,tc_Product__Type_Ounit) ),
file(unknown,unknown) ).
tff(f_28,axiom,
~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
file(unknown,unknown) ).
tff(f_26,axiom,
c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
file(unknown,unknown) ).
tff(c_6,plain,
c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_8,plain,
! [V_cl_1,T_a_2] : ( c_Tarski_Opotype_Opset(c_Tarski_Odual(V_cl_1,T_a_2),T_a_2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(V_cl_1,T_a_2,tc_Product__Type_Ounit) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_4,plain,
~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_9,plain,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_8,c_4]) ).
tff(c_2,plain,
c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_10,plain,
c_lessequals(v_S,v_A,tc_set(t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_11,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : LAT266-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/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 : n011.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 12:50:51 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.39/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.60
% 2.39/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.39/1.64
% 2.39/1.64 Inference rules
% 2.39/1.64 ----------------------
% 2.39/1.64 #Ref : 0
% 2.39/1.64 #Sup : 0
% 2.39/1.64 #Fact : 0
% 2.39/1.64 #Define : 0
% 2.39/1.64 #Split : 0
% 2.39/1.64 #Chain : 0
% 2.39/1.64 #Close : 0
% 2.39/1.64
% 2.39/1.64 Ordering : KBO
% 2.39/1.64
% 2.39/1.64 Simplification rules
% 2.39/1.64 ----------------------
% 2.39/1.64 #Subsume : 3
% 2.39/1.64 #Demod : 3
% 2.39/1.64 #Tautology : 0
% 2.39/1.64 #SimpNegUnit : 1
% 2.39/1.64 #BackRed : 0
% 2.39/1.64
% 2.39/1.64 #Partial instantiations: 0
% 2.39/1.64 #Strategies tried : 1
% 2.39/1.64
% 2.39/1.64 Timing (in seconds)
% 2.39/1.64 ----------------------
% 2.39/1.64 Preprocessing : 0.40
% 2.39/1.64 Parsing : 0.22
% 2.39/1.64 CNF conversion : 0.02
% 2.39/1.64 Main loop : 0.06
% 2.39/1.64 Inferencing : 0.00
% 2.39/1.64 Reduction : 0.03
% 2.39/1.64 Demodulation : 0.02
% 2.39/1.64 BG Simplification : 0.01
% 2.39/1.64 Subsumption : 0.02
% 2.39/1.64 Abstraction : 0.00
% 2.39/1.64 MUC search : 0.00
% 2.39/1.64 Cooper : 0.00
% 2.39/1.64 Total : 0.52
% 2.39/1.65 Index Insertion : 0.00
% 2.39/1.65 Index Deletion : 0.00
% 2.39/1.65 Index Matching : 0.00
% 2.39/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------