TSTP Solution File: SET822-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET822-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 : 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:04 EDT 2023
% Result : Unsatisfiable 2.80s 1.75s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 26 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 29 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 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 : 35 (; 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_in > v_P > c_insert > v_x > #nlpp > v_f > v_b > tc_IntDef_Oint > c_emptyset
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_emptyset,type,
c_emptyset: $i ).
tff(tc_IntDef_Oint,type,
tc_IntDef_Oint: $i ).
tff(v_b,type,
v_b: $i ).
tff(c_in,type,
c_in: ( $i * $i * $i ) > $o ).
tff(v_x,type,
v_x: ( $i * $i ) > $i ).
tff(v_f,type,
v_f: $i > $i ).
tff(c_insert,type,
c_insert: ( $i * $i * $i ) > $i ).
tff(v_P,type,
v_P: $i > $o ).
tff(f_30,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_43,axiom,
! [V_U,V_V] :
( ~ c_in(v_f(V_U),V_V,tc_IntDef_Oint)
| c_in(v_x(V_U,V_V),V_V,tc_IntDef_Oint) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [V_a,V_b,V_A,T_a] :
( ~ c_in(V_a,c_insert(V_b,V_A,T_a),T_a)
| c_in(V_a,V_A,T_a)
| ( V_a = V_b ) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [V_a,T_a] : ~ c_in(V_a,c_emptyset,T_a),
file(unknown,unknown) ).
tff(f_49,axiom,
! [V_U,V_V] :
( ~ c_in(v_f(V_U),V_V,tc_IntDef_Oint)
| ~ v_P(v_x(V_U,V_V)) ),
file(unknown,unknown) ).
tff(f_38,axiom,
v_P(v_f(v_b)),
file(unknown,unknown) ).
tff(c_4,plain,
! [V_x_3,V_B_4,T_a_5] : c_in(V_x_3,c_insert(V_x_3,V_B_4,T_a_5),T_a_5),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
! [V_U_10,V_V_11] :
( c_in(v_x(V_U_10,V_V_11),V_V_11,tc_IntDef_Oint)
| ~ c_in(v_f(V_U_10),V_V_11,tc_IntDef_Oint) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_28,plain,
! [V_b_25,V_a_26,V_A_27,T_a_28] :
( ( V_b_25 = V_a_26 )
| c_in(V_a_26,V_A_27,T_a_28)
| ~ c_in(V_a_26,c_insert(V_b_25,V_A_27,T_a_28),T_a_28) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_39,plain,
! [V_U_29,V_b_30,V_A_31] :
( ( v_x(V_U_29,c_insert(V_b_30,V_A_31,tc_IntDef_Oint)) = V_b_30 )
| c_in(v_x(V_U_29,c_insert(V_b_30,V_A_31,tc_IntDef_Oint)),V_A_31,tc_IntDef_Oint)
| ~ c_in(v_f(V_U_29),c_insert(V_b_30,V_A_31,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(resolution,[status(thm)],[c_10,c_28]) ).
tff(c_2,plain,
! [V_a_1,T_a_2] : ~ c_in(V_a_1,c_emptyset,T_a_2),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_50,plain,
! [V_U_32,V_b_33] :
( ( v_x(V_U_32,c_insert(V_b_33,c_emptyset,tc_IntDef_Oint)) = V_b_33 )
| ~ c_in(v_f(V_U_32),c_insert(V_b_33,c_emptyset,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(resolution,[status(thm)],[c_39,c_2]) ).
tff(c_56,plain,
! [V_U_34] : ( v_x(V_U_34,c_insert(v_f(V_U_34),c_emptyset,tc_IntDef_Oint)) = v_f(V_U_34) ),
inference(resolution,[status(thm)],[c_4,c_50]) ).
tff(c_15,plain,
! [V_U_19,V_V_20] :
( ~ v_P(v_x(V_U_19,V_V_20))
| ~ c_in(v_f(V_U_19),V_V_20,tc_IntDef_Oint) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_20,plain,
! [V_U_19,V_B_4] : ~ v_P(v_x(V_U_19,c_insert(v_f(V_U_19),V_B_4,tc_IntDef_Oint))),
inference(resolution,[status(thm)],[c_4,c_15]) ).
tff(c_67,plain,
! [V_U_34] : ~ v_P(v_f(V_U_34)),
inference(superposition,[status(thm),theory(equality)],[c_56,c_20]) ).
tff(c_8,plain,
v_P(v_f(v_b)),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_79,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_67,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET822-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/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.13/0.36 % Computer : n005.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 17:02:42 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.80/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.75
% 2.80/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.80/1.78
% 2.80/1.78 Inference rules
% 2.80/1.78 ----------------------
% 2.80/1.78 #Ref : 0
% 2.80/1.78 #Sup : 12
% 2.80/1.78 #Fact : 0
% 2.80/1.78 #Define : 0
% 2.80/1.78 #Split : 0
% 2.80/1.78 #Chain : 0
% 2.80/1.78 #Close : 0
% 2.80/1.78
% 2.80/1.78 Ordering : KBO
% 2.80/1.78
% 2.80/1.78 Simplification rules
% 2.80/1.78 ----------------------
% 2.80/1.78 #Subsume : 1
% 2.80/1.78 #Demod : 4
% 2.80/1.78 #Tautology : 5
% 2.80/1.78 #SimpNegUnit : 2
% 2.80/1.78 #BackRed : 1
% 2.80/1.78
% 2.80/1.78 #Partial instantiations: 0
% 2.80/1.78 #Strategies tried : 1
% 2.80/1.78
% 2.80/1.78 Timing (in seconds)
% 2.80/1.78 ----------------------
% 2.80/1.79 Preprocessing : 0.47
% 2.80/1.79 Parsing : 0.24
% 2.80/1.79 CNF conversion : 0.03
% 2.80/1.79 Main loop : 0.24
% 2.80/1.79 Inferencing : 0.12
% 2.80/1.79 Reduction : 0.05
% 2.80/1.79 Demodulation : 0.03
% 2.80/1.79 BG Simplification : 0.02
% 2.80/1.79 Subsumption : 0.05
% 2.80/1.79 Abstraction : 0.01
% 2.80/1.79 MUC search : 0.00
% 2.80/1.79 Cooper : 0.00
% 2.80/1.79 Total : 0.77
% 2.80/1.79 Index Insertion : 0.00
% 2.80/1.79 Index Deletion : 0.00
% 2.80/1.79 Index Matching : 0.00
% 2.80/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------