TSTP Solution File: SET851-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET851-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 : n005.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:12 EDT 2023
% Result : Unsatisfiable 2.81s 1.71s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 31 ( 15 unt; 9 typ; 0 def)
% Number of atoms : 34 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 5 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_Zorn_Osucc > c_Zorn_OTFin > #nlpp > tc_set > v_x > v_m > v_S > t_a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
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(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_40,axiom,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [V_x,V_y,T_a,V_S] :
( ~ c_lessequals(V_x,V_y,tc_set(tc_set(T_a)))
| c_lessequals(V_x,c_Zorn_Osucc(V_S,V_y,T_a),tc_set(tc_set(T_a))) ),
file(unknown,unknown) ).
tff(f_37,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_33,axiom,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_50,axiom,
! [V_U] :
( c_lessequals(c_Zorn_Osucc(v_S,V_U,t_a),v_m,tc_set(tc_set(t_a)))
| ( V_U = v_m )
| ~ c_lessequals(V_U,v_m,tc_set(tc_set(t_a)))
| ~ c_in(V_U,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
file(unknown,unknown) ).
tff(f_35,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,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_12,plain,
( c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_21,plain,
c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_16,plain,
! [V_x_10,V_S_11,V_y_12,T_a_13] :
( c_lessequals(V_x_10,c_Zorn_Osucc(V_S_11,V_y_12,T_a_13),tc_set(tc_set(T_a_13)))
| ~ c_lessequals(V_x_10,V_y_12,tc_set(tc_set(T_a_13))) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_10,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_20,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))),
inference(resolution,[status(thm)],[c_16,c_10]) ).
tff(c_23,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_20]) ).
tff(c_24,plain,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_6,plain,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_26,plain,
! [V_U_14] :
( ~ c_in(V_U_14,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(V_U_14,v_m,tc_set(tc_set(t_a)))
| ( v_m = V_U_14 )
| c_lessequals(c_Zorn_Osucc(v_S,V_U_14,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_8,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_29,plain,
( ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| ( v_x = v_m ) ),
inference(resolution,[status(thm)],[c_26,c_8]) ).
tff(c_32,plain,
v_x = v_m,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_6,c_29]) ).
tff(c_34,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_m,t_a),tc_set(tc_set(t_a))),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_10]) ).
tff(c_40,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET851-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.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:38:26 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.81/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.81/1.72
% 2.81/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.81/1.74
% 2.81/1.74 Inference rules
% 2.81/1.74 ----------------------
% 2.81/1.74 #Ref : 0
% 2.81/1.74 #Sup : 2
% 2.81/1.74 #Fact : 0
% 2.81/1.74 #Define : 0
% 2.81/1.74 #Split : 1
% 2.81/1.74 #Chain : 0
% 2.81/1.74 #Close : 0
% 2.81/1.74
% 2.81/1.74 Ordering : KBO
% 2.81/1.74
% 2.81/1.74 Simplification rules
% 2.81/1.74 ----------------------
% 2.81/1.74 #Subsume : 0
% 2.81/1.74 #Demod : 9
% 2.81/1.74 #Tautology : 1
% 2.81/1.74 #SimpNegUnit : 0
% 2.81/1.74 #BackRed : 4
% 2.81/1.74
% 2.81/1.74 #Partial instantiations: 0
% 2.81/1.74 #Strategies tried : 1
% 2.81/1.74
% 2.81/1.74 Timing (in seconds)
% 2.81/1.74 ----------------------
% 2.81/1.75 Preprocessing : 0.43
% 2.81/1.75 Parsing : 0.24
% 2.81/1.75 CNF conversion : 0.02
% 2.81/1.75 Main loop : 0.18
% 2.81/1.75 Inferencing : 0.08
% 2.81/1.75 Reduction : 0.04
% 2.81/1.75 Demodulation : 0.03
% 2.81/1.75 BG Simplification : 0.01
% 2.81/1.75 Subsumption : 0.05
% 2.81/1.75 Abstraction : 0.01
% 2.81/1.75 MUC search : 0.00
% 2.81/1.75 Cooper : 0.00
% 2.81/1.75 Total : 0.66
% 2.81/1.75 Index Insertion : 0.00
% 2.81/1.75 Index Deletion : 0.00
% 2.81/1.75 Index Matching : 0.00
% 2.81/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------