TSTP Solution File: LAT273-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LAT273-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 : n031.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:35 EDT 2023
% Result : Unsatisfiable 2.79s 1.65s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 39 ( 11 unt; 16 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 51 ( 25 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 8 >; 16 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_Tarski_OisLub > c_lessequals > c_in > c_Tarski_Ointerval > c_Pair > v_sko__4mi > tc_prod > #nlpp > tc_set > v_r > v_cl > v_b > v_a > v_S > v_L > v_A > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_S,type,
v_S: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(v_sko__4mi,type,
v_sko__4mi: ( $i * $i * $i ) > $i ).
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(v_L,type,
v_L: $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
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_OisLub,type,
c_Tarski_OisLub: ( $i * $i * $i * $i ) > $o ).
tff(v_A,type,
v_A: $i ).
tff(c_Tarski_Ointerval,type,
c_Tarski_Ointerval: ( $i * $i * $i * $i ) > $i ).
tff(f_59,axiom,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file(unknown,unknown) ).
tff(f_55,axiom,
c_in(v_b,v_A,t_a),
file(unknown,unknown) ).
tff(f_57,axiom,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file(unknown,unknown) ).
tff(f_43,axiom,
! [V_S,V_L,V_z] :
( ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a)
| ~ c_in(V_z,v_A,t_a)
| c_in(c_Pair(V_L,V_z,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(v_sko__4mi(V_S,v_r,V_z),V_S,t_a) ),
file(unknown,unknown) ).
tff(f_56,axiom,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file(unknown,unknown) ).
tff(f_33,axiom,
! [V_r,V_a,T_a,V_S,V_b,V_x] :
( ~ c_in(V_x,V_S,T_a)
| ~ c_lessequals(V_S,c_Tarski_Ointerval(V_r,V_a,V_b,T_a),tc_set(T_a))
| c_in(c_Pair(V_x,V_b,T_a,T_a),V_r,tc_prod(T_a,T_a)) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [V_S,V_L,V_z] :
( ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a)
| ~ c_in(V_z,v_A,t_a)
| ~ c_in(c_Pair(v_sko__4mi(V_S,v_r,V_z),V_z,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(V_L,V_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file(unknown,unknown) ).
tff(c_14,plain,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_8,plain,
c_in(v_b,v_A,t_a),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_12,plain,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_19,plain,
! [V_S_19,V_z_20,V_L_21] :
( c_in(v_sko__4mi(V_S_19,v_r,V_z_20),V_S_19,t_a)
| c_in(c_Pair(V_L_21,V_z_20,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_z_20,v_A,t_a)
| ~ c_Tarski_OisLub(V_S_19,v_cl,V_L_21,t_a) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_28,plain,
! [V_z_23] :
( c_in(v_sko__4mi(v_S,v_r,V_z_23),v_S,t_a)
| c_in(c_Pair(v_L,V_z_23,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_z_23,v_A,t_a) ),
inference(resolution,[status(thm)],[c_12,c_19]) ).
tff(c_31,plain,
( c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a)
| ~ c_in(v_b,v_A,t_a) ),
inference(resolution,[status(thm)],[c_28,c_14]) ).
tff(c_34,plain,
c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_31]) ).
tff(c_10,plain,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_15,plain,
! [T_a_16,V_x_18,V_r_13,V_a_17,V_S_15,V_b_14] :
( c_in(c_Pair(V_x_18,V_b_14,T_a_16,T_a_16),V_r_13,tc_prod(T_a_16,T_a_16))
| ~ c_lessequals(V_S_15,c_Tarski_Ointerval(V_r_13,V_a_17,V_b_14,T_a_16),tc_set(T_a_16))
| ~ c_in(V_x_18,V_S_15,T_a_16) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_18,plain,
! [V_x_18] :
( c_in(c_Pair(V_x_18,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_x_18,v_S,t_a) ),
inference(resolution,[status(thm)],[c_10,c_15]) ).
tff(c_35,plain,
! [V_L_24,V_z_25,V_S_26] :
( c_in(c_Pair(V_L_24,V_z_25,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_sko__4mi(V_S_26,v_r,V_z_25),V_z_25,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(V_z_25,v_A,t_a)
| ~ c_Tarski_OisLub(V_S_26,v_cl,V_L_24,t_a) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_38,plain,
! [V_L_24,V_S_26] :
( c_in(c_Pair(V_L_24,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(v_b,v_A,t_a)
| ~ c_Tarski_OisLub(V_S_26,v_cl,V_L_24,t_a)
| ~ c_in(v_sko__4mi(V_S_26,v_r,v_b),v_S,t_a) ),
inference(resolution,[status(thm)],[c_18,c_35]) ).
tff(c_42,plain,
! [V_L_27,V_S_28] :
( c_in(c_Pair(V_L_27,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_Tarski_OisLub(V_S_28,v_cl,V_L_27,t_a)
| ~ c_in(v_sko__4mi(V_S_28,v_r,v_b),v_S,t_a) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_38]) ).
tff(c_44,plain,
( c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a) ),
inference(resolution,[status(thm)],[c_12,c_42]) ).
tff(c_47,plain,
c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_44]) ).
tff(c_49,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LAT273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.07/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 : n031.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.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 13:02:59 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.79/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.79/1.65
% 2.79/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.79/1.69
% 2.79/1.69 Inference rules
% 2.79/1.69 ----------------------
% 2.79/1.69 #Ref : 0
% 2.79/1.69 #Sup : 6
% 2.79/1.69 #Fact : 0
% 2.79/1.69 #Define : 0
% 2.79/1.69 #Split : 0
% 2.79/1.69 #Chain : 0
% 2.79/1.69 #Close : 0
% 2.79/1.69
% 2.79/1.69 Ordering : KBO
% 2.79/1.69
% 2.79/1.69 Simplification rules
% 2.79/1.69 ----------------------
% 2.79/1.69 #Subsume : 0
% 2.79/1.69 #Demod : 3
% 2.79/1.69 #Tautology : 0
% 2.79/1.69 #SimpNegUnit : 1
% 2.79/1.69 #BackRed : 0
% 2.79/1.69
% 2.79/1.69 #Partial instantiations: 0
% 2.79/1.69 #Strategies tried : 1
% 2.79/1.69
% 2.79/1.69 Timing (in seconds)
% 2.79/1.69 ----------------------
% 2.79/1.70 Preprocessing : 0.42
% 2.79/1.70 Parsing : 0.24
% 2.79/1.70 CNF conversion : 0.02
% 2.79/1.70 Main loop : 0.19
% 2.79/1.70 Inferencing : 0.09
% 2.79/1.70 Reduction : 0.05
% 2.79/1.70 Demodulation : 0.03
% 2.79/1.70 BG Simplification : 0.01
% 2.79/1.70 Subsumption : 0.03
% 2.79/1.70 Abstraction : 0.01
% 2.79/1.70 MUC search : 0.00
% 2.79/1.70 Cooper : 0.00
% 2.79/1.70 Total : 0.67
% 2.79/1.70 Index Insertion : 0.00
% 2.79/1.70 Index Deletion : 0.00
% 2.79/1.70 Index Matching : 0.00
% 2.79/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------