TSTP Solution File: SET847-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET847-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 : n029.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:11 EDT 2023
% Result : Unsatisfiable 3.22s 1.81s
% Output : CNFRefutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of formulae : 47 ( 13 unt; 13 typ; 0 def)
% Number of atoms : 60 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 33 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 10 >; 14 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 68 (; 68 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_minus > c_Zorn_Osucc > c_Main_OsubsetI__1 > c_Zorn_Omaxchain > c_Zorn_Ochain > c_Zorn_OTFin > c_Union > #nlpp > tc_set > v_S > t_a > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_S,type,
v_S: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_minus,type,
c_minus: ( $i * $i * $i ) > $i ).
tff(c_Zorn_Osucc,type,
c_Zorn_Osucc: ( $i * $i * $i ) > $i ).
tff(c_Zorn_Ochain,type,
c_Zorn_Ochain: ( $i * $i ) > $i ).
tff(c_emptyset,type,
c_emptyset: $i ).
tff(t_a,type,
t_a: $i ).
tff(c_Zorn_OTFin,type,
c_Zorn_OTFin: ( $i * $i ) > $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(c_Zorn_Omaxchain,type,
c_Zorn_Omaxchain: ( $i * $i ) > $i ).
tff(f_51,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_56,axiom,
! [V_Y,V_S,T_a] :
( ~ c_lessequals(V_Y,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(tc_set(T_a))))
| c_in(c_Union(V_Y,tc_set(T_a)),c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a))) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [V_S,T_a] :
( ~ c_in(c_Union(c_Zorn_OTFin(V_S,T_a),tc_set(T_a)),c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| ( c_Union(c_Zorn_OTFin(V_S,T_a),tc_set(T_a)) = c_Zorn_Osucc(V_S,c_Union(c_Zorn_OTFin(V_S,T_a),tc_set(T_a)),T_a) ) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [V_c,V_S,T_a] :
( ~ c_in(V_c,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| c_in(V_c,c_Zorn_Ochain(V_S,T_a),tc_set(tc_set(T_a))) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [V_a,T_a] : ~ c_in(V_a,c_emptyset,T_a),
file(unknown,unknown) ).
tff(f_32,axiom,
! [V_c,V_A,T_a,V_B] :
( ~ c_in(V_c,V_A,T_a)
| c_in(V_c,V_B,T_a)
| c_in(V_c,c_minus(V_A,V_B,tc_set(T_a)),T_a) ),
file(unknown,unknown) ).
tff(f_41,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_75,axiom,
! [V_U] : ~ c_in(V_U,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_37,axiom,
! [V_A,T_a] : c_lessequals(c_emptyset,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_49,axiom,
! [V_B,V_A,T_a] :
( ~ c_lessequals(V_B,V_A,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ( V_A = V_B ) ),
file(unknown,unknown) ).
tff(f_72,axiom,
! [V_c,V_S,T_a] :
( ~ c_in(V_c,c_minus(c_Zorn_Ochain(V_S,T_a),c_Zorn_Omaxchain(V_S,T_a),tc_set(tc_set(tc_set(T_a)))),tc_set(tc_set(T_a)))
| ( c_Zorn_Osucc(V_S,V_c,T_a) != V_c ) ),
file(unknown,unknown) ).
tff(c_12,plain,
! [V_A_15,T_a_16] : c_lessequals(V_A_15,V_A_15,tc_set(T_a_16)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_14,plain,
! [V_Y_17,T_a_19,V_S_18] :
( c_in(c_Union(V_Y_17,tc_set(T_a_19)),c_Zorn_OTFin(V_S_18,T_a_19),tc_set(tc_set(T_a_19)))
| ~ c_lessequals(V_Y_17,c_Zorn_OTFin(V_S_18,T_a_19),tc_set(tc_set(tc_set(T_a_19)))) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_218,plain,
! [V_S_68,T_a_69] :
( ( c_Zorn_Osucc(V_S_68,c_Union(c_Zorn_OTFin(V_S_68,T_a_69),tc_set(T_a_69)),T_a_69) = c_Union(c_Zorn_OTFin(V_S_68,T_a_69),tc_set(T_a_69)) )
| ~ c_in(c_Union(c_Zorn_OTFin(V_S_68,T_a_69),tc_set(T_a_69)),c_Zorn_OTFin(V_S_68,T_a_69),tc_set(tc_set(T_a_69))) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_222,plain,
! [V_S_18,T_a_19] :
( ( c_Zorn_Osucc(V_S_18,c_Union(c_Zorn_OTFin(V_S_18,T_a_19),tc_set(T_a_19)),T_a_19) = c_Union(c_Zorn_OTFin(V_S_18,T_a_19),tc_set(T_a_19)) )
| ~ c_lessequals(c_Zorn_OTFin(V_S_18,T_a_19),c_Zorn_OTFin(V_S_18,T_a_19),tc_set(tc_set(tc_set(T_a_19)))) ),
inference(resolution,[status(thm)],[c_14,c_218]) ).
tff(c_225,plain,
! [V_S_18,T_a_19] : ( c_Zorn_Osucc(V_S_18,c_Union(c_Zorn_OTFin(V_S_18,T_a_19),tc_set(T_a_19)),T_a_19) = c_Union(c_Zorn_OTFin(V_S_18,T_a_19),tc_set(T_a_19)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_222]) ).
tff(c_16,plain,
! [V_c_20,V_S_21,T_a_22] :
( c_in(V_c_20,c_Zorn_Ochain(V_S_21,T_a_22),tc_set(tc_set(T_a_22)))
| ~ c_in(V_c_20,c_Zorn_OTFin(V_S_21,T_a_22),tc_set(tc_set(T_a_22))) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_4,plain,
! [V_a_5,T_a_6] : ~ c_in(V_a_5,c_emptyset,T_a_6),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_2,plain,
! [V_c_1,V_A_2,V_B_4,T_a_3] :
( c_in(V_c_1,c_minus(V_A_2,V_B_4,tc_set(T_a_3)),T_a_3)
| c_in(V_c_1,V_B_4,T_a_3)
| ~ c_in(V_c_1,V_A_2,T_a_3) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_27,plain,
! [V_A_36,V_B_37,T_a_38] :
( c_lessequals(V_A_36,V_B_37,tc_set(T_a_38))
| c_in(c_Main_OsubsetI__1(V_A_36,V_B_37,T_a_38),V_A_36,T_a_38) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_22,plain,
! [V_U_28] : ~ c_in(V_U_28,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_70,plain,
! [V_B_44] : c_lessequals(c_Zorn_Omaxchain(v_S,t_a),V_B_44,tc_set(tc_set(tc_set(t_a)))),
inference(resolution,[status(thm)],[c_27,c_22]) ).
tff(c_6,plain,
! [V_A_7,T_a_8] : c_lessequals(c_emptyset,V_A_7,tc_set(T_a_8)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_39,plain,
! [V_B_39,V_A_40,T_a_41] :
( ( V_B_39 = V_A_40 )
| ~ c_lessequals(V_A_40,V_B_39,tc_set(T_a_41))
| ~ c_lessequals(V_B_39,V_A_40,tc_set(T_a_41)) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_47,plain,
! [V_A_7,T_a_8] :
( ( c_emptyset = V_A_7 )
| ~ c_lessequals(V_A_7,c_emptyset,tc_set(T_a_8)) ),
inference(resolution,[status(thm)],[c_6,c_39]) ).
tff(c_77,plain,
c_Zorn_Omaxchain(v_S,t_a) = c_emptyset,
inference(resolution,[status(thm)],[c_70,c_47]) ).
tff(c_135,plain,
! [V_S_63,V_c_64,T_a_65] :
( ( c_Zorn_Osucc(V_S_63,V_c_64,T_a_65) != V_c_64 )
| ~ c_in(V_c_64,c_minus(c_Zorn_Ochain(V_S_63,T_a_65),c_Zorn_Omaxchain(V_S_63,T_a_65),tc_set(tc_set(tc_set(T_a_65)))),tc_set(tc_set(T_a_65))) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_164,plain,
! [V_c_66] :
( ( c_Zorn_Osucc(v_S,V_c_66,t_a) != V_c_66 )
| ~ c_in(V_c_66,c_minus(c_Zorn_Ochain(v_S,t_a),c_emptyset,tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a))) ),
inference(superposition,[status(thm),theory(equality)],[c_77,c_135]) ).
tff(c_180,plain,
! [V_c_1] :
( ( c_Zorn_Osucc(v_S,V_c_1,t_a) != V_c_1 )
| c_in(V_c_1,c_emptyset,tc_set(tc_set(t_a)))
| ~ c_in(V_c_1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_2,c_164]) ).
tff(c_192,plain,
! [V_c_67] :
( ( c_Zorn_Osucc(v_S,V_c_67,t_a) != V_c_67 )
| ~ c_in(V_c_67,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_180]) ).
tff(c_226,plain,
! [V_c_70] :
( ( c_Zorn_Osucc(v_S,V_c_70,t_a) != V_c_70 )
| ~ c_in(V_c_70,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_16,c_192]) ).
tff(c_262,plain,
! [V_Y_73] :
( ( c_Zorn_Osucc(v_S,c_Union(V_Y_73,tc_set(t_a)),t_a) != c_Union(V_Y_73,tc_set(t_a)) )
| ~ c_lessequals(V_Y_73,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(resolution,[status(thm)],[c_14,c_226]) ).
tff(c_272,plain,
c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a) != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
inference(resolution,[status(thm)],[c_12,c_262]) ).
tff(c_277,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_225,c_272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET847-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/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.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 16:30:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.22/1.81 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.22/1.81
% 3.22/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.22/1.84
% 3.22/1.84 Inference rules
% 3.22/1.84 ----------------------
% 3.22/1.84 #Ref : 0
% 3.22/1.84 #Sup : 44
% 3.22/1.84 #Fact : 2
% 3.22/1.84 #Define : 0
% 3.22/1.84 #Split : 0
% 3.22/1.84 #Chain : 0
% 3.22/1.84 #Close : 0
% 3.22/1.84
% 3.22/1.84 Ordering : KBO
% 3.22/1.84
% 3.22/1.84 Simplification rules
% 3.22/1.84 ----------------------
% 3.22/1.84 #Subsume : 5
% 3.22/1.84 #Demod : 10
% 3.22/1.84 #Tautology : 14
% 3.22/1.84 #SimpNegUnit : 1
% 3.22/1.84 #BackRed : 2
% 3.22/1.84
% 3.22/1.84 #Partial instantiations: 0
% 3.22/1.84 #Strategies tried : 1
% 3.22/1.84
% 3.22/1.84 Timing (in seconds)
% 3.22/1.84 ----------------------
% 3.22/1.84 Preprocessing : 0.45
% 3.22/1.84 Parsing : 0.25
% 3.22/1.84 CNF conversion : 0.02
% 3.22/1.84 Main loop : 0.32
% 3.22/1.84 Inferencing : 0.14
% 3.22/1.84 Reduction : 0.08
% 3.22/1.85 Demodulation : 0.06
% 3.22/1.85 BG Simplification : 0.02
% 3.22/1.85 Subsumption : 0.06
% 3.22/1.85 Abstraction : 0.02
% 3.22/1.85 MUC search : 0.00
% 3.22/1.85 Cooper : 0.00
% 3.22/1.85 Total : 0.82
% 3.22/1.85 Index Insertion : 0.00
% 3.22/1.85 Index Deletion : 0.00
% 3.22/1.85 Index Matching : 0.00
% 3.22/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------