TSTP Solution File: SYN005-1.010 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN005-1.010 : TPTP v8.1.2. Released v1.0.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 : n008.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 11:08:29 EDT 2023
% Result : Unsatisfiable 2.85s 1.77s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 43 ( 22 unt; 11 typ; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 119 ( 65 ~; 54 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 10 >; 10 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 56 (; 56 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p_9 > p_8 > p_7 > p_6 > p_5 > p_4 > p_3 > p_2 > p_10 > p_1 > #nlpp > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p_5,type,
p_5: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(p_9,type,
p_9: ( $i * $i ) > $o ).
tff(p_8,type,
p_8: ( $i * $i ) > $o ).
tff(p_3,type,
p_3: ( $i * $i ) > $o ).
tff(p_7,type,
p_7: ( $i * $i ) > $o ).
tff(p_4,type,
p_4: ( $i * $i ) > $o ).
tff(p_2,type,
p_2: ( $i * $i ) > $o ).
tff(p_1,type,
p_1: ( $i * $i ) > $o ).
tff(p_10,type,
p_10: ( $i * $i ) > $o ).
tff(p_6,type,
p_6: ( $i * $i ) > $o ).
tff(f_59,axiom,
p_1(a,a),
file(unknown,unknown) ).
tff(f_60,axiom,
p_2(a,a),
file(unknown,unknown) ).
tff(f_61,axiom,
p_3(a,a),
file(unknown,unknown) ).
tff(f_62,axiom,
p_4(a,a),
file(unknown,unknown) ).
tff(f_63,axiom,
p_5(a,a),
file(unknown,unknown) ).
tff(f_64,axiom,
p_6(a,a),
file(unknown,unknown) ).
tff(f_65,axiom,
p_7(a,a),
file(unknown,unknown) ).
tff(f_66,axiom,
p_8(a,a),
file(unknown,unknown) ).
tff(f_67,axiom,
p_9(a,a),
file(unknown,unknown) ).
tff(f_68,axiom,
p_10(a,a),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X5,X6,X3,X9,X7,X1,X2,X8,X4,X10] :
( ~ p_1(X1,X2)
| ~ p_2(X2,X3)
| ~ p_3(X3,X4)
| ~ p_4(X4,X5)
| ~ p_5(X5,X6)
| ~ p_6(X6,X7)
| ~ p_7(X7,X8)
| ~ p_8(X8,X9)
| ~ p_9(X9,X10)
| ~ p_10(X10,X1) ),
file(unknown,unknown) ).
tff(c_4,plain,
p_1(a,a),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_6,plain,
p_2(a,a),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_8,plain,
p_3(a,a),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_10,plain,
p_4(a,a),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_12,plain,
p_5(a,a),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_14,plain,
p_6(a,a),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_16,plain,
p_7(a,a),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_18,plain,
p_8(a,a),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_20,plain,
p_9(a,a),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_22,plain,
p_10(a,a),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_23,plain,
! [X6_17,X2_20,X4_12,X7_11,X5_19,X1_18,X8_15,X10_16,X9_14,X3_13] :
( ~ p_10(X10_16,X1_18)
| ~ p_9(X9_14,X10_16)
| ~ p_8(X8_15,X9_14)
| ~ p_7(X7_11,X8_15)
| ~ p_6(X6_17,X7_11)
| ~ p_5(X5_19,X6_17)
| ~ p_4(X4_12,X5_19)
| ~ p_3(X3_13,X4_12)
| ~ p_2(X2_20,X3_13)
| ~ p_1(X1_18,X2_20) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_27,plain,
! [X9_28,X4_27,X5_26,X8_24,X2_25,X6_23,X3_21,X7_22] :
( ~ p_9(X9_28,a)
| ~ p_8(X8_24,X9_28)
| ~ p_7(X7_22,X8_24)
| ~ p_6(X6_23,X7_22)
| ~ p_5(X5_26,X6_23)
| ~ p_4(X4_27,X5_26)
| ~ p_3(X3_21,X4_27)
| ~ p_2(X2_25,X3_21)
| ~ p_1(a,X2_25) ),
inference(resolution,[status(thm)],[c_22,c_23]) ).
tff(c_31,plain,
! [X4_30,X2_32,X7_33,X6_35,X8_34,X5_29,X3_31] :
( ~ p_8(X8_34,a)
| ~ p_7(X7_33,X8_34)
| ~ p_6(X6_35,X7_33)
| ~ p_5(X5_29,X6_35)
| ~ p_4(X4_30,X5_29)
| ~ p_3(X3_31,X4_30)
| ~ p_2(X2_32,X3_31)
| ~ p_1(a,X2_32) ),
inference(resolution,[status(thm)],[c_20,c_27]) ).
tff(c_35,plain,
! [X6_38,X3_40,X5_41,X4_36,X2_37,X7_39] :
( ~ p_7(X7_39,a)
| ~ p_6(X6_38,X7_39)
| ~ p_5(X5_41,X6_38)
| ~ p_4(X4_36,X5_41)
| ~ p_3(X3_40,X4_36)
| ~ p_2(X2_37,X3_40)
| ~ p_1(a,X2_37) ),
inference(resolution,[status(thm)],[c_18,c_31]) ).
tff(c_39,plain,
! [X4_46,X6_42,X5_44,X3_45,X2_43] :
( ~ p_6(X6_42,a)
| ~ p_5(X5_44,X6_42)
| ~ p_4(X4_46,X5_44)
| ~ p_3(X3_45,X4_46)
| ~ p_2(X2_43,X3_45)
| ~ p_1(a,X2_43) ),
inference(resolution,[status(thm)],[c_16,c_35]) ).
tff(c_43,plain,
! [X5_47,X4_48,X3_49,X2_50] :
( ~ p_5(X5_47,a)
| ~ p_4(X4_48,X5_47)
| ~ p_3(X3_49,X4_48)
| ~ p_2(X2_50,X3_49)
| ~ p_1(a,X2_50) ),
inference(resolution,[status(thm)],[c_14,c_39]) ).
tff(c_47,plain,
! [X4_51,X3_52,X2_53] :
( ~ p_4(X4_51,a)
| ~ p_3(X3_52,X4_51)
| ~ p_2(X2_53,X3_52)
| ~ p_1(a,X2_53) ),
inference(resolution,[status(thm)],[c_12,c_43]) ).
tff(c_51,plain,
! [X3_54,X2_55] :
( ~ p_3(X3_54,a)
| ~ p_2(X2_55,X3_54)
| ~ p_1(a,X2_55) ),
inference(resolution,[status(thm)],[c_10,c_47]) ).
tff(c_55,plain,
! [X2_56] :
( ~ p_2(X2_56,a)
| ~ p_1(a,X2_56) ),
inference(resolution,[status(thm)],[c_8,c_51]) ).
tff(c_58,plain,
~ p_1(a,a),
inference(resolution,[status(thm)],[c_6,c_55]) ).
tff(c_62,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN005-1.010 : TPTP v8.1.2. Released v1.0.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.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 17:30:49 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.85/1.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.77
% 2.85/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.85/1.80
% 2.85/1.80 Inference rules
% 2.85/1.80 ----------------------
% 2.85/1.80 #Ref : 0
% 2.85/1.80 #Sup : 9
% 2.85/1.80 #Fact : 0
% 2.85/1.80 #Define : 0
% 2.85/1.80 #Split : 0
% 2.85/1.80 #Chain : 0
% 2.85/1.80 #Close : 0
% 2.85/1.80
% 2.85/1.80 Ordering : KBO
% 2.85/1.80
% 2.85/1.80 Simplification rules
% 2.85/1.80 ----------------------
% 2.85/1.80 #Subsume : 0
% 2.85/1.81 #Demod : 1
% 2.85/1.81 #Tautology : 0
% 2.85/1.81 #SimpNegUnit : 0
% 2.85/1.81 #BackRed : 0
% 2.85/1.81
% 2.85/1.81 #Partial instantiations: 0
% 2.85/1.81 #Strategies tried : 1
% 2.85/1.81
% 2.85/1.81 Timing (in seconds)
% 2.85/1.81 ----------------------
% 2.85/1.81 Preprocessing : 0.43
% 2.85/1.81 Parsing : 0.24
% 2.85/1.81 CNF conversion : 0.02
% 2.85/1.81 Main loop : 0.24
% 2.85/1.81 Inferencing : 0.12
% 2.85/1.81 Reduction : 0.05
% 2.85/1.81 Demodulation : 0.04
% 2.85/1.81 BG Simplification : 0.02
% 2.85/1.81 Subsumption : 0.04
% 2.85/1.81 Abstraction : 0.01
% 2.85/1.81 MUC search : 0.00
% 2.85/1.81 Cooper : 0.00
% 2.85/1.81 Total : 0.72
% 2.85/1.81 Index Insertion : 0.00
% 2.85/1.81 Index Deletion : 0.00
% 2.85/1.81 Index Matching : 0.00
% 2.85/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------