TSTP Solution File: SET848-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET848-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 : n012.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.67s 1.67s
% Output : CNFRefutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 33 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 19 ~; 13 |; 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 : 21 ( 9 >; 12 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_minus > c_Zorn_Osucc > c_Zorn_Omaxchain > c_Zorn_Ochain > 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_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(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(c_Zorn_Omaxchain,type,
c_Zorn_Omaxchain: ( $i * $i ) > $i ).
tff(f_34,axiom,
! [V_A,T_a] : c_lessequals(V_A,V_A,tc_set(T_a)),
file(unknown,unknown) ).
tff(f_39,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_44,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_53,axiom,
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)),
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_50,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(f_52,axiom,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_A_5,T_a_6] : c_lessequals(V_A_5,V_A_5,tc_set(T_a_6)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_6,plain,
! [V_Y_7,T_a_9,V_S_8] :
( c_in(c_Union(V_Y_7,tc_set(T_a_9)),c_Zorn_OTFin(V_S_8,T_a_9),tc_set(tc_set(T_a_9)))
| ~ c_lessequals(V_Y_7,c_Zorn_OTFin(V_S_8,T_a_9),tc_set(tc_set(tc_set(T_a_9)))) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_8,plain,
! [V_c_10,V_S_11,T_a_12] :
( c_in(V_c_10,c_Zorn_Ochain(V_S_11,T_a_12),tc_set(tc_set(T_a_12)))
| ~ c_in(V_c_10,c_Zorn_OTFin(V_S_11,T_a_12),tc_set(tc_set(T_a_12))) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_14,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(cnfTransformation,[status(thm)],[f_53]) ).
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_23,plain,
! [V_S_28,V_c_29,T_a_30] :
( ( c_Zorn_Osucc(V_S_28,V_c_29,T_a_30) != V_c_29 )
| ~ c_in(V_c_29,c_minus(c_Zorn_Ochain(V_S_28,T_a_30),c_Zorn_Omaxchain(V_S_28,T_a_30),tc_set(tc_set(tc_set(T_a_30)))),tc_set(tc_set(T_a_30))) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_29,plain,
! [V_S_31,V_c_32,T_a_33] :
( ( c_Zorn_Osucc(V_S_31,V_c_32,T_a_33) != V_c_32 )
| c_in(V_c_32,c_Zorn_Omaxchain(V_S_31,T_a_33),tc_set(tc_set(T_a_33)))
| ~ c_in(V_c_32,c_Zorn_Ochain(V_S_31,T_a_33),tc_set(tc_set(T_a_33))) ),
inference(resolution,[status(thm)],[c_2,c_23]) ).
tff(c_12,plain,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_32,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)) )
| ~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_29,c_12]) ).
tff(c_35,plain,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_32]) ).
tff(c_39,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_8,c_35]) ).
tff(c_42,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_6,c_39]) ).
tff(c_46,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET848-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.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 16:20:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.67/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.67/1.67
% 2.67/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.67/1.70
% 2.67/1.70 Inference rules
% 2.67/1.70 ----------------------
% 2.67/1.70 #Ref : 0
% 2.67/1.70 #Sup : 6
% 2.67/1.70 #Fact : 0
% 2.67/1.70 #Define : 0
% 2.67/1.70 #Split : 0
% 2.67/1.70 #Chain : 0
% 2.67/1.70 #Close : 0
% 2.67/1.70
% 2.67/1.70 Ordering : KBO
% 2.67/1.70
% 2.67/1.70 Simplification rules
% 2.67/1.70 ----------------------
% 2.67/1.70 #Subsume : 0
% 2.67/1.70 #Demod : 2
% 2.67/1.70 #Tautology : 2
% 2.67/1.70 #SimpNegUnit : 0
% 2.67/1.70 #BackRed : 0
% 2.67/1.70
% 2.67/1.70 #Partial instantiations: 0
% 2.67/1.70 #Strategies tried : 1
% 2.67/1.70
% 2.67/1.70 Timing (in seconds)
% 2.67/1.70 ----------------------
% 2.67/1.70 Preprocessing : 0.43
% 2.67/1.70 Parsing : 0.24
% 2.67/1.70 CNF conversion : 0.02
% 2.67/1.70 Main loop : 0.20
% 2.67/1.70 Inferencing : 0.09
% 2.67/1.70 Reduction : 0.04
% 2.67/1.70 Demodulation : 0.03
% 2.67/1.70 BG Simplification : 0.01
% 2.67/1.71 Subsumption : 0.04
% 2.67/1.71 Abstraction : 0.01
% 2.67/1.71 MUC search : 0.00
% 2.67/1.71 Cooper : 0.00
% 2.67/1.71 Total : 0.68
% 2.67/1.71 Index Insertion : 0.00
% 2.67/1.71 Index Deletion : 0.00
% 2.67/1.71 Index Matching : 0.00
% 2.67/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------