TSTP Solution File: SET844-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET844-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:10 EDT 2023
% Result : Unsatisfiable 2.61s 1.65s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 10 unt; 9 typ; 0 def)
% Number of atoms : 31 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Zorn_Osucc > c_Zorn_OTFin > c_Union > #nlpp > tc_set > v_m > 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_Zorn_OTFin,type,
c_Zorn_OTFin: ( $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(f_27,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_45,axiom,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
file(unknown,unknown) ).
tff(f_44,axiom,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_32,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_43,axiom,
! [V_m,V_S,T_a,V_n] :
( ~ c_in(V_m,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| ~ c_in(V_n,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| ( V_m != c_Zorn_Osucc(V_S,V_m,T_a) )
| c_lessequals(V_n,V_m,tc_set(tc_set(T_a))) ),
file(unknown,unknown) ).
tff(f_47,axiom,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(c_2,plain,
! [V_A_1,T_a_2] : c_lessequals(V_A_1,V_A_1,tc_set(T_a_2)),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_10,plain,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_8,plain,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_4,plain,
! [V_Y_3,T_a_5,V_S_4] :
( c_in(c_Union(V_Y_3,tc_set(T_a_5)),c_Zorn_OTFin(V_S_4,T_a_5),tc_set(tc_set(T_a_5)))
| ~ c_lessequals(V_Y_3,c_Zorn_OTFin(V_S_4,T_a_5),tc_set(tc_set(tc_set(T_a_5)))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_19,plain,
! [V_n_15,V_m_16,T_a_17,V_S_18] :
( c_lessequals(V_n_15,V_m_16,tc_set(tc_set(T_a_17)))
| ( c_Zorn_Osucc(V_S_18,V_m_16,T_a_17) != V_m_16 )
| ~ c_in(V_n_15,c_Zorn_OTFin(V_S_18,T_a_17),tc_set(tc_set(T_a_17)))
| ~ c_in(V_m_16,c_Zorn_OTFin(V_S_18,T_a_17),tc_set(tc_set(T_a_17))) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_44,plain,
! [V_Y_21,T_a_22,V_m_23,V_S_24] :
( c_lessequals(c_Union(V_Y_21,tc_set(T_a_22)),V_m_23,tc_set(tc_set(T_a_22)))
| ( c_Zorn_Osucc(V_S_24,V_m_23,T_a_22) != V_m_23 )
| ~ c_in(V_m_23,c_Zorn_OTFin(V_S_24,T_a_22),tc_set(tc_set(T_a_22)))
| ~ c_lessequals(V_Y_21,c_Zorn_OTFin(V_S_24,T_a_22),tc_set(tc_set(tc_set(T_a_22)))) ),
inference(resolution,[status(thm)],[c_4,c_19]) ).
tff(c_48,plain,
! [V_Y_21] :
( c_lessequals(c_Union(V_Y_21,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| ( c_Zorn_Osucc(v_S,v_m,t_a) != v_m )
| ~ c_lessequals(V_Y_21,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(resolution,[status(thm)],[c_8,c_44]) ).
tff(c_53,plain,
! [V_Y_25] :
( c_lessequals(c_Union(V_Y_25,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| ~ c_lessequals(V_Y_25,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_48]) ).
tff(c_12,plain,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_56,plain,
~ c_lessequals(c_Zorn_OTFin(v_S,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))),
inference(resolution,[status(thm)],[c_53,c_12]) ).
tff(c_60,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET844-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/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.18/0.36 % Computer : n018.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 16:57:05 EDT 2023
% 0.18/0.37 % CPUTime :
% 2.61/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.61/1.65
% 2.61/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.69
% 2.84/1.69 Inference rules
% 2.84/1.69 ----------------------
% 2.84/1.69 #Ref : 0
% 2.84/1.69 #Sup : 10
% 2.84/1.69 #Fact : 0
% 2.84/1.69 #Define : 0
% 2.84/1.69 #Split : 1
% 2.84/1.69 #Chain : 0
% 2.84/1.69 #Close : 0
% 2.84/1.69
% 2.84/1.69 Ordering : KBO
% 2.84/1.69
% 2.84/1.69 Simplification rules
% 2.84/1.69 ----------------------
% 2.84/1.69 #Subsume : 0
% 2.84/1.69 #Demod : 4
% 2.84/1.69 #Tautology : 3
% 2.84/1.69 #SimpNegUnit : 0
% 2.84/1.69 #BackRed : 0
% 2.84/1.69
% 2.84/1.69 #Partial instantiations: 0
% 2.84/1.69 #Strategies tried : 1
% 2.84/1.69
% 2.84/1.69 Timing (in seconds)
% 2.84/1.69 ----------------------
% 2.84/1.69 Preprocessing : 0.41
% 2.84/1.69 Parsing : 0.22
% 2.84/1.69 CNF conversion : 0.02
% 2.84/1.69 Main loop : 0.20
% 2.84/1.69 Inferencing : 0.08
% 2.84/1.69 Reduction : 0.05
% 2.84/1.69 Demodulation : 0.04
% 2.84/1.69 BG Simplification : 0.01
% 2.84/1.69 Subsumption : 0.05
% 2.84/1.69 Abstraction : 0.01
% 2.84/1.69 MUC search : 0.00
% 2.84/1.69 Cooper : 0.00
% 2.84/1.69 Total : 0.66
% 2.84/1.69 Index Insertion : 0.00
% 2.84/1.69 Index Deletion : 0.00
% 2.84/1.69 Index Matching : 0.00
% 2.84/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------