TSTP Solution File: SYN559-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN559-1 : TPTP v8.1.2. Released v2.5.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 : n001.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:11:18 EDT 2023
% Result : Unsatisfiable 6.13s 2.56s
% Output : CNFRefutation 6.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of formulae : 44 ( 16 unt; 14 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 30 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p8 > p7 > p2 > f6 > f5 > f3 > #nlpp > f4 > c9 > c15 > c14 > c13 > c12 > c11 > c10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f5,type,
f5: ( $i * $i ) > $i ).
tff(c12,type,
c12: $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c9,type,
c9: $i ).
tff(c14,type,
c14: $i ).
tff(p8,type,
p8: ( $i * $i ) > $o ).
tff(c10,type,
c10: $i ).
tff(c15,type,
c15: $i ).
tff(c11,type,
c11: $i ).
tff(f4,type,
f4: $i > $i ).
tff(c13,type,
c13: $i ).
tff(f3,type,
f3: ( $i * $i ) > $i ).
tff(p7,type,
p7: ( $i * $i ) > $o ).
tff(f6,type,
f6: ( $i * $i ) > $i ).
tff(f_23,axiom,
! [X0] : p2(X0,X0),
file(unknown,unknown) ).
tff(f_24,axiom,
p8(c13,c9),
file(unknown,unknown) ).
tff(f_25,axiom,
p7(c10,c13),
file(unknown,unknown) ).
tff(f_26,axiom,
p2(f6(c9,c13),c14),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X1,X2,X0] :
( p2(X1,X2)
| ~ p2(X0,X1)
| ~ p2(X0,X2) ),
file(unknown,unknown) ).
tff(f_28,axiom,
p2(f3(f4(c11),c12),c15),
file(unknown,unknown) ).
tff(f_27,axiom,
p2(f5(c14,c10),c15),
file(unknown,unknown) ).
tff(f_99,axiom,
! [X26,X25] :
( ~ p8(X26,c9)
| ~ p7(c10,X26)
| ~ p2(f6(c9,X26),X25)
| ~ p2(f5(X25,c10),f3(f4(c11),c12)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X0_1] : p2(X0_1,X0_1),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_4,plain,
p8(c13,c9),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_6,plain,
p7(c10,c13),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_8,plain,
p2(f6(c9,c13),c14),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_31,plain,
! [X0_32,X2_33,X1_34] :
( ~ p2(X0_32,X2_33)
| ~ p2(X0_32,X1_34)
| p2(X1_34,X2_33) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_47,plain,
! [X0_35,X1_36] :
( ~ p2(X0_35,X1_36)
| p2(X1_36,X0_35) ),
inference(resolution,[status(thm)],[c_2,c_31]) ).
tff(c_61,plain,
p2(c14,f6(c9,c13)),
inference(resolution,[status(thm)],[c_8,c_47]) ).
tff(c_16,plain,
! [X0_6,X2_5,X1_4] :
( ~ p2(X0_6,X2_5)
| ~ p2(X0_6,X1_4)
| p2(X1_4,X2_5) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_172,plain,
! [X1_49] :
( ~ p2(c14,X1_49)
| p2(X1_49,f6(c9,c13)) ),
inference(resolution,[status(thm)],[c_61,c_16]) ).
tff(c_46,plain,
! [X0_1,X1_34] :
( ~ p2(X0_1,X1_34)
| p2(X1_34,X0_1) ),
inference(resolution,[status(thm)],[c_2,c_31]) ).
tff(c_195,plain,
! [X1_49] :
( p2(f6(c9,c13),X1_49)
| ~ p2(c14,X1_49) ),
inference(resolution,[status(thm)],[c_172,c_46]) ).
tff(c_12,plain,
p2(f3(f4(c11),c12),c15),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_59,plain,
p2(c15,f3(f4(c11),c12)),
inference(resolution,[status(thm)],[c_12,c_47]) ).
tff(c_10,plain,
p2(f5(c14,c10),c15),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_60,plain,
p2(c15,f5(c14,c10)),
inference(resolution,[status(thm)],[c_10,c_47]) ).
tff(c_197,plain,
! [X1_50] :
( ~ p2(c15,X1_50)
| p2(X1_50,f5(c14,c10)) ),
inference(resolution,[status(thm)],[c_60,c_16]) ).
tff(c_220,plain,
! [X1_50] :
( p2(f5(c14,c10),X1_50)
| ~ p2(c15,X1_50) ),
inference(resolution,[status(thm)],[c_197,c_46]) ).
tff(c_436,plain,
! [X25_77,X26_78] :
( ~ p2(f5(X25_77,c10),f3(f4(c11),c12))
| ~ p2(f6(c9,X26_78),X25_77)
| ~ p7(c10,X26_78)
| ~ p8(X26_78,c9) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_442,plain,
! [X26_78] :
( ~ p2(f6(c9,X26_78),c14)
| ~ p7(c10,X26_78)
| ~ p8(X26_78,c9)
| ~ p2(c15,f3(f4(c11),c12)) ),
inference(resolution,[status(thm)],[c_220,c_436]) ).
tff(c_3105,plain,
! [X26_210] :
( ~ p2(f6(c9,X26_210),c14)
| ~ p7(c10,X26_210)
| ~ p8(X26_210,c9) ),
inference(demodulation,[status(thm),theory(equality)],[c_59,c_442]) ).
tff(c_3113,plain,
( ~ p7(c10,c13)
| ~ p8(c13,c9)
| ~ p2(c14,c14) ),
inference(resolution,[status(thm)],[c_195,c_3105]) ).
tff(c_3123,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_6,c_3113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN559-1 : TPTP v8.1.2. Released v2.5.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 : n001.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 18:00:25 EDT 2023
% 0.13/0.36 % CPUTime :
% 6.13/2.56 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.13/2.57
% 6.13/2.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.13/2.59
% 6.13/2.59 Inference rules
% 6.13/2.59 ----------------------
% 6.13/2.59 #Ref : 0
% 6.13/2.59 #Sup : 864
% 6.13/2.59 #Fact : 0
% 6.13/2.59 #Define : 0
% 6.13/2.59 #Split : 20
% 6.13/2.59 #Chain : 0
% 6.13/2.59 #Close : 0
% 6.13/2.59
% 6.13/2.59 Ordering : KBO
% 6.13/2.59
% 6.13/2.59 Simplification rules
% 6.13/2.59 ----------------------
% 6.13/2.59 #Subsume : 142
% 6.13/2.59 #Demod : 121
% 6.13/2.59 #Tautology : 66
% 6.13/2.59 #SimpNegUnit : 5
% 6.13/2.59 #BackRed : 0
% 6.13/2.59
% 6.13/2.59 #Partial instantiations: 0
% 6.13/2.59 #Strategies tried : 1
% 6.13/2.59
% 6.13/2.59 Timing (in seconds)
% 6.13/2.59 ----------------------
% 6.13/2.60 Preprocessing : 0.43
% 6.13/2.60 Parsing : 0.24
% 6.13/2.60 CNF conversion : 0.02
% 6.13/2.60 Main loop : 1.03
% 6.13/2.60 Inferencing : 0.34
% 6.13/2.60 Reduction : 0.27
% 6.13/2.60 Demodulation : 0.18
% 6.13/2.60 BG Simplification : 0.03
% 6.13/2.60 Subsumption : 0.31
% 6.13/2.60 Abstraction : 0.03
% 6.13/2.60 MUC search : 0.00
% 6.13/2.60 Cooper : 0.00
% 6.13/2.60 Total : 1.51
% 6.13/2.60 Index Insertion : 0.00
% 6.13/2.60 Index Deletion : 0.00
% 6.13/2.60 Index Matching : 0.00
% 6.13/2.60 BG Taut test : 0.00
%------------------------------------------------------------------------------