TSTP Solution File: SET841-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET841-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 : n022.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:09 EDT 2023
% Result : Unsatisfiable 2.67s 1.58s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 27 ( 15 unt; 9 typ; 0 def)
% Number of atoms : 29 ( 6 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 12 (; 12 !; 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_42,axiom,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
file(unknown,unknown) ).
tff(f_43,axiom,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_41,axiom,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_44,axiom,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_40,axiom,
! [V_n,V_S,T_a,V_m] :
( ~ c_in(V_n,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| ~ c_in(V_m,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))
| ~ c_lessequals(V_n,V_m,tc_set(tc_set(T_a)))
| c_lessequals(c_Zorn_Osucc(V_S,V_n,T_a),V_m,tc_set(tc_set(T_a)))
| ( V_n = V_m ) ),
file(unknown,unknown) ).
tff(f_46,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_8,plain,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_10,plain,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_6,plain,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_12,plain,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_20,plain,
! [V_n_9,V_m_10,V_S_11,T_a_12] :
( ( V_n_9 = V_m_10 )
| c_lessequals(c_Zorn_Osucc(V_S_11,V_n_9,T_a_12),V_m_10,tc_set(tc_set(T_a_12)))
| ~ c_lessequals(V_n_9,V_m_10,tc_set(tc_set(T_a_12)))
| ~ c_in(V_m_10,c_Zorn_OTFin(V_S_11,T_a_12),tc_set(tc_set(T_a_12)))
| ~ c_in(V_n_9,c_Zorn_OTFin(V_S_11,T_a_12),tc_set(tc_set(T_a_12))) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_14,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_46]) ).
tff(c_23,plain,
( ( v_x = v_m )
| ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_20,c_14]) ).
tff(c_29,plain,
v_x = v_m,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_6,c_12,c_23]) ).
tff(c_32,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))),
inference(demodulation,[status(thm),theory(equality)],[c_29,c_14]) ).
tff(c_37,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_8,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET841-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 16:16:03 EDT 2023
% 0.12/0.34 % CPUTime :
% 2.67/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.67/1.58
% 2.67/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.83/1.61
% 2.83/1.61 Inference rules
% 2.83/1.61 ----------------------
% 2.83/1.61 #Ref : 0
% 2.83/1.61 #Sup : 4
% 2.83/1.61 #Fact : 0
% 2.83/1.61 #Define : 0
% 2.83/1.61 #Split : 0
% 2.83/1.61 #Chain : 0
% 2.83/1.61 #Close : 0
% 2.83/1.61
% 2.83/1.61 Ordering : KBO
% 2.83/1.61
% 2.83/1.61 Simplification rules
% 2.83/1.61 ----------------------
% 2.83/1.61 #Subsume : 0
% 2.83/1.61 #Demod : 9
% 2.83/1.61 #Tautology : 3
% 2.83/1.61 #SimpNegUnit : 0
% 2.83/1.61 #BackRed : 3
% 2.83/1.61
% 2.83/1.61 #Partial instantiations: 0
% 2.83/1.61 #Strategies tried : 1
% 2.83/1.61
% 2.83/1.61 Timing (in seconds)
% 2.83/1.61 ----------------------
% 2.83/1.61 Preprocessing : 0.40
% 2.83/1.61 Parsing : 0.23
% 2.83/1.61 CNF conversion : 0.02
% 2.83/1.61 Main loop : 0.17
% 2.83/1.61 Inferencing : 0.08
% 2.83/1.61 Reduction : 0.04
% 2.83/1.61 Demodulation : 0.03
% 2.83/1.61 BG Simplification : 0.01
% 2.83/1.61 Subsumption : 0.03
% 2.83/1.61 Abstraction : 0.01
% 2.83/1.61 MUC search : 0.00
% 2.83/1.61 Cooper : 0.00
% 2.83/1.61 Total : 0.62
% 2.83/1.61 Index Insertion : 0.00
% 2.83/1.61 Index Deletion : 0.00
% 2.83/1.61 Index Matching : 0.00
% 2.83/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------