TSTP Solution File: SET839-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET839-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 : n011.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 3.34s 1.89s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 47 ( 8 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 22 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 5 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 48 (; 48 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_in > c_insert > c_Main_OsubsetI__1 > #nlpp > tc_set > v_S > t_a > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_S,type,
v_S: $i ).
tff(tc_set,type,
tc_set: $i > $i ).
tff(c_emptyset,type,
c_emptyset: $i ).
tff(t_a,type,
t_a: $i ).
tff(c_Main_OsubsetI__1,type,
c_Main_OsubsetI__1: ( $i * $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_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(f_38,axiom,
! [V_x,V_B,T_a] : c_in(V_x,c_insert(V_x,V_B,T_a),T_a),
file(unknown,unknown) ).
tff(f_28,axiom,
! [V_U] : ~ c_lessequals(v_S,c_insert(V_U,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
file(unknown,unknown) ).
tff(f_42,axiom,
! [V_A,V_B,T_a] :
( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)
| c_lessequals(V_A,V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [V_U,V_V] :
( c_lessequals(V_U,V_V,tc_set(t_a))
| ~ c_in(V_V,v_S,tc_set(t_a))
| ~ c_in(V_U,v_S,tc_set(t_a)) ),
file(unknown,unknown) ).
tff(f_55,axiom,
! [V_B,V_A,T_a] :
( ~ c_lessequals(V_B,V_A,tc_set(T_a))
| ~ c_lessequals(V_A,V_B,tc_set(T_a))
| ( V_A = V_B ) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [V_A,V_B,T_a] :
( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)
| c_lessequals(V_A,V_B,tc_set(T_a)) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [V_x_4,V_B_5,T_a_6] : c_in(V_x_4,c_insert(V_x_4,V_B_5,T_a_6),T_a_6),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_2,plain,
! [V_U_1] : ~ c_lessequals(v_S,c_insert(V_U_1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_8,plain,
! [V_A_7,V_B_8,T_a_9] :
( c_lessequals(V_A_7,V_B_8,tc_set(T_a_9))
| c_in(c_Main_OsubsetI__1(V_A_7,V_B_8,T_a_9),V_A_7,T_a_9) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_4,plain,
! [V_U_2,V_V_3] :
( ~ c_in(V_U_2,v_S,tc_set(t_a))
| ~ c_in(V_V_3,v_S,tc_set(t_a))
| c_lessequals(V_U_2,V_V_3,tc_set(t_a)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_26,plain,
! [V_U_29,V_V_30] :
( ~ c_in(V_U_29,v_S,tc_set(t_a))
| ~ c_in(V_V_30,v_S,tc_set(t_a))
| c_lessequals(V_U_29,V_V_30,tc_set(t_a)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_12,plain,
! [V_B_13,V_A_14,T_a_15] :
( ( V_B_13 = V_A_14 )
| ~ c_lessequals(V_A_14,V_B_13,tc_set(T_a_15))
| ~ c_lessequals(V_B_13,V_A_14,tc_set(T_a_15)) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_67,plain,
! [V_V_39,V_U_40] :
( ( V_V_39 = V_U_40 )
| ~ c_lessequals(V_V_39,V_U_40,tc_set(t_a))
| ~ c_in(V_U_40,v_S,tc_set(t_a))
| ~ c_in(V_V_39,v_S,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_26,c_12]) ).
tff(c_83,plain,
! [V_V_41,V_U_42] :
( ( V_V_41 = V_U_42 )
| ~ c_in(V_U_42,v_S,tc_set(t_a))
| ~ c_in(V_V_41,v_S,tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_4,c_67]) ).
tff(c_96,plain,
! [V_B_43,V_V_44] :
( ( c_Main_OsubsetI__1(v_S,V_B_43,tc_set(t_a)) = V_V_44 )
| ~ c_in(V_V_44,v_S,tc_set(t_a))
| c_lessequals(v_S,V_B_43,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_8,c_83]) ).
tff(c_138,plain,
! [V_B_48,V_B_47] :
( ( c_Main_OsubsetI__1(v_S,V_B_48,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,V_B_47,tc_set(t_a)) )
| c_lessequals(v_S,V_B_48,tc_set(tc_set(t_a)))
| c_lessequals(v_S,V_B_47,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_8,c_96]) ).
tff(c_205,plain,
! [V_U_49,V_B_50] :
( ( c_Main_OsubsetI__1(v_S,c_insert(V_U_49,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_Main_OsubsetI__1(v_S,V_B_50,tc_set(t_a)) )
| c_lessequals(v_S,V_B_50,tc_set(tc_set(t_a))) ),
inference(resolution,[status(thm)],[c_138,c_2]) ).
tff(c_290,plain,
! [V_U_52,V_U_51] : ( c_Main_OsubsetI__1(v_S,c_insert(V_U_52,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_Main_OsubsetI__1(v_S,c_insert(V_U_51,c_emptyset,tc_set(t_a)),tc_set(t_a)) ),
inference(resolution,[status(thm)],[c_205,c_2]) ).
tff(c_10,plain,
! [V_A_10,V_B_11,T_a_12] :
( c_lessequals(V_A_10,V_B_11,tc_set(T_a_12))
| ~ c_in(c_Main_OsubsetI__1(V_A_10,V_B_11,T_a_12),V_B_11,T_a_12) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_334,plain,
! [V_U_52,V_U_51] :
( c_lessequals(v_S,c_insert(V_U_52,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a)))
| ~ c_in(c_Main_OsubsetI__1(v_S,c_insert(V_U_51,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(V_U_52,c_emptyset,tc_set(t_a)),tc_set(t_a)) ),
inference(superposition,[status(thm),theory(equality)],[c_290,c_10]) ).
tff(c_429,plain,
! [V_U_56,V_U_57] : ~ c_in(c_Main_OsubsetI__1(v_S,c_insert(V_U_56,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(V_U_57,c_emptyset,tc_set(t_a)),tc_set(t_a)),
inference(negUnitSimplification,[status(thm)],[c_2,c_334]) ).
tff(c_452,plain,
$false,
inference(resolution,[status(thm)],[c_6,c_429]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET839-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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 16:36:21 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.34/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.34/1.89
% 3.34/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.34/1.92
% 3.34/1.92 Inference rules
% 3.34/1.92 ----------------------
% 3.34/1.92 #Ref : 0
% 3.34/1.92 #Sup : 114
% 3.34/1.92 #Fact : 4
% 3.34/1.92 #Define : 0
% 3.34/1.92 #Split : 0
% 3.34/1.92 #Chain : 0
% 3.34/1.92 #Close : 0
% 3.34/1.92
% 3.34/1.92 Ordering : KBO
% 3.34/1.92
% 3.34/1.92 Simplification rules
% 3.34/1.92 ----------------------
% 3.34/1.92 #Subsume : 66
% 3.34/1.92 #Demod : 5
% 3.34/1.92 #Tautology : 11
% 3.34/1.92 #SimpNegUnit : 32
% 3.34/1.92 #BackRed : 0
% 3.34/1.92
% 3.34/1.92 #Partial instantiations: 0
% 3.34/1.92 #Strategies tried : 1
% 3.34/1.92
% 3.34/1.92 Timing (in seconds)
% 3.34/1.92 ----------------------
% 3.34/1.92 Preprocessing : 0.42
% 3.34/1.92 Parsing : 0.23
% 3.34/1.92 CNF conversion : 0.02
% 3.34/1.92 Main loop : 0.40
% 3.34/1.92 Inferencing : 0.18
% 3.34/1.92 Reduction : 0.10
% 3.34/1.92 Demodulation : 0.07
% 3.34/1.92 BG Simplification : 0.02
% 3.34/1.92 Subsumption : 0.09
% 3.34/1.92 Abstraction : 0.02
% 3.34/1.92 MUC search : 0.00
% 3.34/1.92 Cooper : 0.00
% 3.34/1.92 Total : 0.87
% 3.34/1.92 Index Insertion : 0.00
% 3.34/1.92 Index Deletion : 0.00
% 3.34/1.92 Index Matching : 0.00
% 3.34/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------