TSTP Solution File: SET830-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET830-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:57:06 EDT 2023
% Result : Unsatisfiable 3.45s 1.88s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of formulae : 41 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 25 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 5 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 63 (; 63 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_inter > c_Main_OsubsetI__1 > #nlpp > tc_set > v_x > v_Z > v_Y > v_X > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(v_X,type,
v_X: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(t_a,type,
t_a: $i ).
tff(c_Main_OsubsetI__1,type,
c_Main_OsubsetI__1: ( $i * $i * $i ) > $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(c_inter,type,
c_inter: ( $i * $i * $i ) > $i ).
tff(v_Y,type,
v_Y: $i ).
tff(v_Z,type,
v_Z: $i ).
tff(f_64,axiom,
~ c_in(v_x,v_X,t_a),
file(unknown,unknown) ).
tff(f_61,axiom,
c_in(v_x,v_Y,t_a),
file(unknown,unknown) ).
tff(f_62,axiom,
c_in(v_x,v_Z,t_a),
file(unknown,unknown) ).
tff(f_43,axiom,
! [V_c,V_B,T_a,V_A] :
( ~ c_in(V_c,V_B,T_a)
| ~ c_in(V_c,V_A,T_a)
| c_in(V_c,c_inter(V_A,V_B,T_a),T_a) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [V_A,V_B,T_a] :
( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)
| c_lessequals(V_A,V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [V_c,V_A,V_B,T_a] :
( ~ c_in(V_c,c_inter(V_A,V_B,T_a),T_a)
| c_in(V_c,V_A,T_a) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [V_A,V_B,T_a] :
( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)
| c_lessequals(V_A,V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [V_c,V_A,V_B,T_a] :
( ~ c_in(V_c,c_inter(V_A,V_B,T_a),T_a)
| c_in(V_c,V_B,T_a) ),
file(unknown,unknown) ).
tff(f_72,axiom,
! [V_U] :
( c_lessequals(V_U,v_X,tc_set(t_a))
| ~ c_lessequals(V_U,v_Z,tc_set(t_a))
| ~ c_lessequals(V_U,v_Y,tc_set(t_a)) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [V_c,V_A,T_a,V_B] :
( ~ c_in(V_c,V_A,T_a)
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| c_in(V_c,V_B,T_a) ),
file(unknown,unknown) ).
tff(c_18,plain,
~ c_in(v_x,v_X,t_a),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_14,plain,
c_in(v_x,v_Y,t_a),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_16,plain,
c_in(v_x,v_Z,t_a),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_6,plain,
! [V_c_9,V_A_12,V_B_10,T_a_11] :
( c_in(V_c_9,c_inter(V_A_12,V_B_10,T_a_11),T_a_11)
| ~ c_in(V_c_9,V_A_12,T_a_11)
| ~ c_in(V_c_9,V_B_10,T_a_11) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_24,plain,
! [V_A_35,V_B_36,T_a_37] :
( c_lessequals(V_A_35,V_B_36,tc_set(T_a_37))
| c_in(c_Main_OsubsetI__1(V_A_35,V_B_36,T_a_37),V_A_35,T_a_37) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_4,plain,
! [V_c_5,V_A_6,T_a_8,V_B_7] :
( c_in(V_c_5,V_A_6,T_a_8)
| ~ c_in(V_c_5,c_inter(V_A_6,V_B_7,T_a_8),T_a_8) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_207,plain,
! [V_A_66,V_B_67,T_a_68,V_B_69] :
( c_in(c_Main_OsubsetI__1(c_inter(V_A_66,V_B_67,T_a_68),V_B_69,T_a_68),V_A_66,T_a_68)
| c_lessequals(c_inter(V_A_66,V_B_67,T_a_68),V_B_69,tc_set(T_a_68)) ),
inference(resolution,[status(thm)],[c_24,c_4]) ).
tff(c_12,plain,
! [V_A_20,V_B_21,T_a_22] :
( c_lessequals(V_A_20,V_B_21,tc_set(T_a_22))
| ~ c_in(c_Main_OsubsetI__1(V_A_20,V_B_21,T_a_22),V_B_21,T_a_22) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_242,plain,
! [V_A_70,V_B_71,T_a_72] : c_lessequals(c_inter(V_A_70,V_B_71,T_a_72),V_A_70,tc_set(T_a_72)),
inference(resolution,[status(thm)],[c_207,c_12]) ).
tff(c_2,plain,
! [V_c_1,V_B_3,T_a_4,V_A_2] :
( c_in(V_c_1,V_B_3,T_a_4)
| ~ c_in(V_c_1,c_inter(V_A_2,V_B_3,T_a_4),T_a_4) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_120,plain,
! [V_A_56,V_B_57,T_a_58,V_B_59] :
( c_in(c_Main_OsubsetI__1(c_inter(V_A_56,V_B_57,T_a_58),V_B_59,T_a_58),V_B_57,T_a_58)
| c_lessequals(c_inter(V_A_56,V_B_57,T_a_58),V_B_59,tc_set(T_a_58)) ),
inference(resolution,[status(thm)],[c_24,c_2]) ).
tff(c_153,plain,
! [V_A_60,V_B_61,T_a_62] : c_lessequals(c_inter(V_A_60,V_B_61,T_a_62),V_B_61,tc_set(T_a_62)),
inference(resolution,[status(thm)],[c_120,c_12]) ).
tff(c_20,plain,
! [V_U_23] :
( ~ c_lessequals(V_U_23,v_Y,tc_set(t_a))
| ~ c_lessequals(V_U_23,v_Z,tc_set(t_a))
| c_lessequals(V_U_23,v_X,tc_set(t_a)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_164,plain,
! [V_A_60] :
( ~ c_lessequals(c_inter(V_A_60,v_Z,t_a),v_Y,tc_set(t_a))
| c_lessequals(c_inter(V_A_60,v_Z,t_a),v_X,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_153,c_20]) ).
tff(c_256,plain,
c_lessequals(c_inter(v_Y,v_Z,t_a),v_X,tc_set(t_a)),
inference(resolution,[status(thm)],[c_242,c_164]) ).
tff(c_8,plain,
! [V_c_13,V_B_16,T_a_15,V_A_14] :
( c_in(V_c_13,V_B_16,T_a_15)
| ~ c_lessequals(V_A_14,V_B_16,tc_set(T_a_15))
| ~ c_in(V_c_13,V_A_14,T_a_15) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_263,plain,
! [V_c_73] :
( c_in(V_c_73,v_X,t_a)
| ~ c_in(V_c_73,c_inter(v_Y,v_Z,t_a),t_a) ),
inference(resolution,[status(thm)],[c_256,c_8]) ).
tff(c_288,plain,
! [V_c_74] :
( c_in(V_c_74,v_X,t_a)
| ~ c_in(V_c_74,v_Y,t_a)
| ~ c_in(V_c_74,v_Z,t_a) ),
inference(resolution,[status(thm)],[c_6,c_263]) ).
tff(c_312,plain,
( c_in(v_x,v_X,t_a)
| ~ c_in(v_x,v_Y,t_a) ),
inference(resolution,[status(thm)],[c_16,c_288]) ).
tff(c_321,plain,
c_in(v_x,v_X,t_a),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_312]) ).
tff(c_323,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_18,c_321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET830-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n003.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 16:26:53 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.45/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/1.88
% 3.45/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.45/1.92
% 3.45/1.92 Inference rules
% 3.45/1.92 ----------------------
% 3.45/1.92 #Ref : 0
% 3.45/1.92 #Sup : 62
% 3.45/1.92 #Fact : 0
% 3.45/1.92 #Define : 0
% 3.45/1.92 #Split : 2
% 3.45/1.92 #Chain : 0
% 3.45/1.92 #Close : 0
% 3.45/1.92
% 3.45/1.92 Ordering : KBO
% 3.45/1.92
% 3.45/1.92 Simplification rules
% 3.45/1.92 ----------------------
% 3.45/1.92 #Subsume : 2
% 3.45/1.92 #Demod : 10
% 3.45/1.92 #Tautology : 8
% 3.45/1.92 #SimpNegUnit : 1
% 3.45/1.92 #BackRed : 0
% 3.45/1.92
% 3.45/1.92 #Partial instantiations: 0
% 3.45/1.92 #Strategies tried : 1
% 3.45/1.92
% 3.45/1.92 Timing (in seconds)
% 3.45/1.92 ----------------------
% 3.45/1.92 Preprocessing : 0.44
% 3.45/1.92 Parsing : 0.24
% 3.45/1.92 CNF conversion : 0.03
% 3.45/1.92 Main loop : 0.40
% 3.45/1.92 Inferencing : 0.17
% 3.45/1.92 Reduction : 0.09
% 3.45/1.92 Demodulation : 0.06
% 3.45/1.92 BG Simplification : 0.02
% 3.45/1.92 Subsumption : 0.10
% 3.45/1.92 Abstraction : 0.01
% 3.45/1.92 MUC search : 0.00
% 3.45/1.92 Cooper : 0.00
% 3.45/1.92 Total : 0.89
% 3.45/1.92 Index Insertion : 0.00
% 3.45/1.92 Index Deletion : 0.00
% 3.45/1.92 Index Matching : 0.00
% 3.45/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------