TSTP Solution File: SET846-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET846-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 : n016.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 2.37s 1.64s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 11 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Zorn_Osucc > c_Zorn_OTFin > c_Union > #nlpp > tc_set > 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(f_32,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_42,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_37,axiom,
! [V_x,V_S,T_a] :
( ~ c_in(V_x,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| c_in(c_Zorn_Osucc(V_S,V_x,T_a),c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a))) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [V_B,V_A,T_a] :
( ~ c_in(V_B,V_A,tc_set(T_a))
| c_lessequals(V_B,c_Union(V_A,T_a),tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_44,axiom,
~ c_lessequals(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)),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_A_4,T_a_5] : c_lessequals(V_A_4,V_A_4,tc_set(T_a_5)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_8,plain,
! [V_Y_9,T_a_11,V_S_10] :
( c_in(c_Union(V_Y_9,tc_set(T_a_11)),c_Zorn_OTFin(V_S_10,T_a_11),tc_set(tc_set(T_a_11)))
| ~ c_lessequals(V_Y_9,c_Zorn_OTFin(V_S_10,T_a_11),tc_set(tc_set(tc_set(T_a_11)))) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_17,plain,
! [V_S_17,V_x_18,T_a_19] :
( c_in(c_Zorn_Osucc(V_S_17,V_x_18,T_a_19),c_Zorn_OTFin(V_S_17,T_a_19),tc_set(tc_set(T_a_19)))
| ~ c_in(V_x_18,c_Zorn_OTFin(V_S_17,T_a_19),tc_set(tc_set(T_a_19))) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2,plain,
! [V_B_1,V_A_2,T_a_3] :
( c_lessequals(V_B_1,c_Union(V_A_2,T_a_3),tc_set(T_a_3))
| ~ c_in(V_B_1,V_A_2,tc_set(T_a_3)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
~ c_lessequals(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)),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_16,plain,
~ c_in(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(resolution,[status(thm)],[c_2,c_10]) ).
tff(c_21,plain,
~ 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))),
inference(resolution,[status(thm)],[c_17,c_16]) ).
tff(c_25,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_8,c_21]) ).
tff(c_29,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET846-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 : n016.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 17:25:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.37/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.37/1.65
% 2.37/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.37/1.68
% 2.37/1.68 Inference rules
% 2.37/1.68 ----------------------
% 2.37/1.68 #Ref : 0
% 2.37/1.68 #Sup : 3
% 2.37/1.68 #Fact : 0
% 2.37/1.68 #Define : 0
% 2.37/1.68 #Split : 0
% 2.37/1.68 #Chain : 0
% 2.37/1.68 #Close : 0
% 2.37/1.68
% 2.37/1.68 Ordering : KBO
% 2.37/1.68
% 2.37/1.68 Simplification rules
% 2.37/1.68 ----------------------
% 2.37/1.68 #Subsume : 0
% 2.37/1.68 #Demod : 1
% 2.37/1.68 #Tautology : 0
% 2.37/1.68 #SimpNegUnit : 0
% 2.37/1.68 #BackRed : 0
% 2.37/1.68
% 2.37/1.68 #Partial instantiations: 0
% 2.37/1.68 #Strategies tried : 1
% 2.37/1.68
% 2.37/1.68 Timing (in seconds)
% 2.37/1.68 ----------------------
% 2.74/1.68 Preprocessing : 0.43
% 2.74/1.68 Parsing : 0.24
% 2.74/1.69 CNF conversion : 0.02
% 2.74/1.69 Main loop : 0.15
% 2.74/1.69 Inferencing : 0.07
% 2.74/1.69 Reduction : 0.03
% 2.74/1.69 Demodulation : 0.03
% 2.74/1.69 BG Simplification : 0.01
% 2.74/1.69 Subsumption : 0.03
% 2.74/1.69 Abstraction : 0.01
% 2.74/1.69 MUC search : 0.00
% 2.74/1.69 Cooper : 0.00
% 2.74/1.69 Total : 0.64
% 2.74/1.69 Index Insertion : 0.00
% 2.74/1.69 Index Deletion : 0.00
% 2.74/1.69 Index Matching : 0.00
% 2.74/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------