TSTP Solution File: SET852-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET852-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 : n012.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:13 EDT 2023
% Result : Unsatisfiable 2.75s 1.70s
% Output : CNFRefutation 3.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 29 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 13 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 6 >; 10 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Zorn_OUnion__lemma0__1 > c_Zorn_Osucc > c_Union > #nlpp > tc_set > v_m > v_Y > v_S > 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_Zorn_Osucc,type,
c_Zorn_Osucc: ( $i * $i * $i ) > $i ).
tff(t_a,type,
t_a: $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(c_Zorn_OUnion__lemma0__1,type,
c_Zorn_OUnion__lemma0__1: ( $i * $i * $i * $i ) > $i ).
tff(v_m,type,
v_m: $i ).
tff(v_Y,type,
v_Y: $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_42,axiom,
! [V_A,V_B,V_C,T_a] :
( c_in(c_Zorn_OUnion__lemma0__1(V_A,V_B,V_C,T_a),V_C,tc_set(T_a))
| c_lessequals(V_B,c_Union(V_C,T_a),tc_set(T_a))
| c_lessequals(c_Union(V_C,T_a),V_A,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [V_U] :
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),V_U,tc_set(tc_set(t_a)))
| 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_56,axiom,
! [V_B,V_A,V_C,T_a] :
( ~ c_lessequals(V_B,c_Zorn_OUnion__lemma0__1(V_A,V_B,V_C,T_a),tc_set(T_a))
| c_lessequals(V_B,c_Union(V_C,T_a),tc_set(T_a))
| c_lessequals(c_Union(V_C,T_a),V_A,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [V_A,V_B,V_C,T_a] :
( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(V_A,V_B,V_C,T_a),V_A,tc_set(T_a))
| c_lessequals(V_B,c_Union(V_C,T_a),tc_set(T_a))
| c_lessequals(c_Union(V_C,T_a),V_A,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_27,plain,
! [V_C_19,T_a_20,V_A_21,V_B_22] :
( c_lessequals(c_Union(V_C_19,T_a_20),V_A_21,tc_set(T_a_20))
| c_lessequals(V_B_22,c_Union(V_C_19,T_a_20),tc_set(T_a_20))
| c_in(c_Zorn_OUnion__lemma0__1(V_A_21,V_B_22,V_C_19,T_a_20),V_C_19,tc_set(T_a_20)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_40,plain,
! [V_B_23] :
( c_lessequals(V_B_23,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_in(c_Zorn_OUnion__lemma0__1(v_m,V_B_23,v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_27,c_2]) ).
tff(c_4,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_44,plain,
c_in(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))),
inference(resolution,[status(thm)],[c_40,c_4]) ).
tff(c_6,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)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),V_U_1,tc_set(tc_set(t_a))) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_20,plain,
! [V_C_15,T_a_16,V_A_17,V_B_18] :
( c_lessequals(c_Union(V_C_15,T_a_16),V_A_17,tc_set(T_a_16))
| c_lessequals(V_B_18,c_Union(V_C_15,T_a_16),tc_set(T_a_16))
| ~ c_lessequals(V_B_18,c_Zorn_OUnion__lemma0__1(V_A_17,V_B_18,V_C_15,T_a_16),tc_set(T_a_16)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_60,plain,
! [V_C_41,V_A_42] :
( c_lessequals(c_Union(V_C_41,tc_set(t_a)),V_A_42,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(V_C_41,tc_set(t_a)),tc_set(tc_set(t_a)))
| ~ c_in(c_Zorn_OUnion__lemma0__1(V_A_42,c_Zorn_Osucc(v_S,v_m,t_a),V_C_41,tc_set(t_a)),v_Y,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OUnion__lemma0__1(V_A_42,c_Zorn_Osucc(v_S,v_m,t_a),V_C_41,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_6,c_20]) ).
tff(c_10,plain,
! [V_C_8,T_a_9,V_A_6,V_B_7] :
( c_lessequals(c_Union(V_C_8,T_a_9),V_A_6,tc_set(T_a_9))
| c_lessequals(V_B_7,c_Union(V_C_8,T_a_9),tc_set(T_a_9))
| ~ c_lessequals(c_Zorn_OUnion__lemma0__1(V_A_6,V_B_7,V_C_8,T_a_9),V_A_6,tc_set(T_a_9)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_66,plain,
! [V_C_43] :
( c_lessequals(c_Union(V_C_43,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(V_C_43,tc_set(t_a)),tc_set(tc_set(t_a)))
| ~ c_in(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),V_C_43,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_60,c_10]) ).
tff(c_69,plain,
( c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| ~ c_in(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_66,c_4]) ).
tff(c_72,plain,
c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_69]) ).
tff(c_74,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET852-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 : n012.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.21/0.35 % DateTime : Thu Aug 3 16:18:07 EDT 2023
% 0.21/0.35 % CPUTime :
% 2.75/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.75/1.70
% 2.75/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.06/1.73
% 3.06/1.73 Inference rules
% 3.06/1.73 ----------------------
% 3.06/1.73 #Ref : 0
% 3.06/1.73 #Sup : 10
% 3.06/1.73 #Fact : 0
% 3.06/1.73 #Define : 0
% 3.06/1.73 #Split : 0
% 3.06/1.73 #Chain : 0
% 3.06/1.73 #Close : 0
% 3.06/1.73
% 3.06/1.73 Ordering : KBO
% 3.06/1.73
% 3.06/1.73 Simplification rules
% 3.06/1.73 ----------------------
% 3.06/1.73 #Subsume : 0
% 3.06/1.73 #Demod : 1
% 3.06/1.73 #Tautology : 0
% 3.06/1.73 #SimpNegUnit : 2
% 3.06/1.73 #BackRed : 0
% 3.06/1.73
% 3.06/1.73 #Partial instantiations: 0
% 3.06/1.73 #Strategies tried : 1
% 3.06/1.73
% 3.06/1.73 Timing (in seconds)
% 3.06/1.73 ----------------------
% 3.06/1.73 Preprocessing : 0.43
% 3.06/1.73 Parsing : 0.24
% 3.06/1.73 CNF conversion : 0.02
% 3.06/1.73 Main loop : 0.25
% 3.06/1.73 Inferencing : 0.13
% 3.06/1.74 Reduction : 0.04
% 3.06/1.74 Demodulation : 0.02
% 3.06/1.74 BG Simplification : 0.01
% 3.06/1.74 Subsumption : 0.06
% 3.06/1.74 Abstraction : 0.01
% 3.06/1.74 MUC search : 0.00
% 3.06/1.74 Cooper : 0.00
% 3.06/1.74 Total : 0.73
% 3.06/1.74 Index Insertion : 0.00
% 3.06/1.74 Index Deletion : 0.00
% 3.06/1.74 Index Matching : 0.00
% 3.06/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------