TSTP Solution File: SET842-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET842-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 : n018.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:09 EDT 2023
% Result : Unsatisfiable 3.10s 1.91s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 29 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 39 ( 19 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 6 >; 9 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 40 (; 40 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Main_OsubsetI__1 > c_Main_OUnionE__1 > c_Union > #nlpp > tc_set > v_m > v_Y > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
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_Union,type,
c_Union: ( $i * $i ) > $i ).
tff(v_m,type,
v_m: $i ).
tff(v_Y,type,
v_Y: $i ).
tff(c_Main_OUnionE__1,type,
c_Main_OUnionE__1: ( $i * $i * $i ) > $i ).
tff(f_27,axiom,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_54,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_37,axiom,
! [V_A,V_C,T_a] :
( ~ c_in(V_A,c_Union(V_C,T_a),T_a)
| c_in(c_Main_OUnionE__1(V_A,V_C,T_a),V_C,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [V_A,V_C,T_a] :
( ~ c_in(V_A,c_Union(V_C,T_a),T_a)
| c_in(V_A,c_Main_OUnionE__1(V_A,V_C,T_a),T_a) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [V_U] :
( c_lessequals(V_U,v_m,tc_set(tc_set(t_a)))
| ~ c_in(V_U,v_Y,tc_set(tc_set(t_a))) ),
file(unknown,unknown) ).
tff(f_50,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(f_59,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(c_2,plain,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_12,plain,
! [V_A_12,V_B_13,T_a_14] :
( c_lessequals(V_A_12,V_B_13,tc_set(T_a_14))
| c_in(c_Main_OsubsetI__1(V_A_12,V_B_13,T_a_14),V_A_12,T_a_14) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_6,plain,
! [V_A_2,V_C_3,T_a_4] :
( c_in(c_Main_OUnionE__1(V_A_2,V_C_3,T_a_4),V_C_3,tc_set(T_a_4))
| ~ c_in(V_A_2,c_Union(V_C_3,T_a_4),T_a_4) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_8,plain,
! [V_A_5,V_C_6,T_a_7] :
( c_in(V_A_5,c_Main_OUnionE__1(V_A_5,V_C_6,T_a_7),T_a_7)
| ~ c_in(V_A_5,c_Union(V_C_6,T_a_7),T_a_7) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_4,plain,
! [V_U_1] :
( ~ c_in(V_U_1,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(V_U_1,v_m,tc_set(tc_set(t_a))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_27,plain,
! [V_c_25,V_B_26,T_a_27,V_A_28] :
( c_in(V_c_25,V_B_26,T_a_27)
| ~ c_lessequals(V_A_28,V_B_26,tc_set(T_a_27))
| ~ c_in(V_c_25,V_A_28,T_a_27) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_50,plain,
! [V_c_41,V_U_42] :
( c_in(V_c_41,v_m,tc_set(t_a))
| ~ c_in(V_c_41,V_U_42,tc_set(t_a))
| ~ c_in(V_U_42,v_Y,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_4,c_27]) ).
tff(c_173,plain,
! [V_A_60,V_C_61] :
( c_in(V_A_60,v_m,tc_set(t_a))
| ~ c_in(c_Main_OUnionE__1(V_A_60,V_C_61,tc_set(t_a)),v_Y,tc_set(tc_set(t_a)))
| ~ c_in(V_A_60,c_Union(V_C_61,tc_set(t_a)),tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_8,c_50]) ).
tff(c_184,plain,
! [V_A_62] :
( c_in(V_A_62,v_m,tc_set(t_a))
| ~ c_in(V_A_62,c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_6,c_173]) ).
tff(c_225,plain,
! [V_B_64] :
( c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),V_B_64,tc_set(t_a)),v_m,tc_set(t_a))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),V_B_64,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_12,c_184]) ).
tff(c_14,plain,
! [V_A_15,V_B_16,T_a_17] :
( c_lessequals(V_A_15,V_B_16,tc_set(T_a_17))
| ~ c_in(c_Main_OsubsetI__1(V_A_15,V_B_16,T_a_17),V_B_16,T_a_17) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_234,plain,
c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(resolution,[status(thm)],[c_225,c_14]) ).
tff(c_241,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_2,c_234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SET842-2 : TPTP v8.1.2. Released v3.2.0.
% 0.14/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.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 16:31:50 EDT 2023
% 0.16/0.36 % CPUTime :
% 3.10/1.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.92
% 3.10/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.37/1.95
% 3.37/1.95 Inference rules
% 3.37/1.95 ----------------------
% 3.37/1.95 #Ref : 0
% 3.37/1.95 #Sup : 52
% 3.37/1.95 #Fact : 2
% 3.37/1.95 #Define : 0
% 3.37/1.95 #Split : 0
% 3.37/1.95 #Chain : 0
% 3.37/1.95 #Close : 0
% 3.37/1.95
% 3.37/1.95 Ordering : KBO
% 3.37/1.95
% 3.37/1.95 Simplification rules
% 3.37/1.95 ----------------------
% 3.37/1.95 #Subsume : 8
% 3.37/1.95 #Demod : 4
% 3.37/1.95 #Tautology : 3
% 3.37/1.95 #SimpNegUnit : 1
% 3.37/1.95 #BackRed : 0
% 3.37/1.95
% 3.37/1.95 #Partial instantiations: 0
% 3.37/1.95 #Strategies tried : 1
% 3.37/1.95
% 3.37/1.95 Timing (in seconds)
% 3.37/1.95 ----------------------
% 3.37/1.95 Preprocessing : 0.43
% 3.37/1.95 Parsing : 0.24
% 3.37/1.95 CNF conversion : 0.02
% 3.37/1.95 Main loop : 0.35
% 3.37/1.95 Inferencing : 0.16
% 3.37/1.95 Reduction : 0.06
% 3.37/1.95 Demodulation : 0.04
% 3.37/1.95 BG Simplification : 0.02
% 3.37/1.95 Subsumption : 0.09
% 3.37/1.95 Abstraction : 0.01
% 3.37/1.95 MUC search : 0.00
% 3.37/1.95 Cooper : 0.00
% 3.37/1.95 Total : 0.83
% 3.37/1.95 Index Insertion : 0.00
% 3.37/1.95 Index Deletion : 0.00
% 3.37/1.95 Index Matching : 0.00
% 3.37/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------