TSTP Solution File: SYN573-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN573-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/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 : n007.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:20 EDT 2023
% Result : Unsatisfiable 7.85s 2.98s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 24
% Syntax : Number of formulae : 41 ( 12 unt; 16 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 24 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 12 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 38 (; 38 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p4 > p2 > p13 > p11 > p12 > f3 > #nlpp > f9 > f8 > f7 > f6 > f5 > f10 > c17 > c16 > c15 > c14
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p12,type,
p12: $i > $o ).
tff(p4,type,
p4: ( $i * $i ) > $o ).
tff(c16,type,
c16: $i ).
tff(f7,type,
f7: $i > $i ).
tff(p13,type,
p13: ( $i * $i ) > $o ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c14,type,
c14: $i ).
tff(c17,type,
c17: $i ).
tff(p11,type,
p11: ( $i * $i ) > $o ).
tff(c15,type,
c15: $i ).
tff(f5,type,
f5: $i > $i ).
tff(f6,type,
f6: $i > $i ).
tff(f9,type,
f9: $i > $i ).
tff(f8,type,
f8: $i > $i ).
tff(f3,type,
f3: ( $i * $i ) > $i ).
tff(f10,type,
f10: $i > $i ).
tff(f_138,axiom,
! [X4,X5,X6] :
( p11(X4,f3(f8(X5),f3(f8(X6),f5(f6(f7(c14))))))
| ~ p11(X4,X5) ),
file(unknown,unknown) ).
tff(f_125,axiom,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
file(unknown,unknown) ).
tff(f_22,axiom,
p12(c15),
file(unknown,unknown) ).
tff(f_92,axiom,
! [X9] :
( p11(X9,c16)
| p2(X9,f9(c17))
| ~ p12(X9) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X17] : p2(X17,X17),
file(unknown,unknown) ).
tff(f_85,axiom,
! [X18,X19,X17] :
( p2(X18,X19)
| ~ p2(X17,X18)
| ~ p2(X17,X19) ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X7,X8] : p11(X7,f3(f8(X8),f3(f8(X7),f5(f6(f7(c14)))))),
file(unknown,unknown) ).
tff(f_112,axiom,
! [X0,X1,X2,X3] :
( p11(X0,X1)
| ~ p2(X2,X0)
| ~ p2(X3,X1)
| ~ p11(X2,X3) ),
file(unknown,unknown) ).
tff(c_609,plain,
! [X4_139,X5_140,X6_141] :
( ~ p11(X4_139,X5_140)
| p11(X4_139,f3(f8(X5_140),f3(f8(X6_141),f5(f6(f7(c14)))))) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_38,plain,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_615,plain,
~ p11(c15,c16),
inference(resolution,[status(thm)],[c_609,c_38]) ).
tff(c_2,plain,
p12(c15),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_159,plain,
! [X9_76] :
( ~ p12(X9_76)
| p2(X9_76,f9(c17))
| p11(X9_76,c16) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_6,plain,
! [X17_2] : p2(X17_2,X17_2),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_108,plain,
! [X17_68,X19_69,X18_70] :
( ~ p2(X17_68,X19_69)
| ~ p2(X17_68,X18_70)
| p2(X18_70,X19_69) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_123,plain,
! [X17_2,X18_70] :
( ~ p2(X17_2,X18_70)
| p2(X18_70,X17_2) ),
inference(resolution,[status(thm)],[c_6,c_108]) ).
tff(c_167,plain,
! [X9_76] :
( p2(f9(c17),X9_76)
| ~ p12(X9_76)
| p11(X9_76,c16) ),
inference(resolution,[status(thm)],[c_159,c_123]) ).
tff(c_32,plain,
! [X7_26,X8_27] : p11(X7_26,f3(f8(X8_27),f3(f8(X7_26),f5(f6(f7(c14)))))),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_319,plain,
! [X2_109,X3_110,X1_111,X0_112] :
( ~ p11(X2_109,X3_110)
| ~ p2(X3_110,X1_111)
| ~ p2(X2_109,X0_112)
| p11(X0_112,X1_111) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_2118,plain,
! [X8_276,X7_277,X1_278,X0_279] :
( ~ p2(f3(f8(X8_276),f3(f8(X7_277),f5(f6(f7(c14))))),X1_278)
| ~ p2(X7_277,X0_279)
| p11(X0_279,X1_278) ),
inference(resolution,[status(thm)],[c_32,c_319]) ).
tff(c_5434,plain,
! [X7_398,X0_399,X8_400] :
( ~ p2(X7_398,X0_399)
| p11(X0_399,f3(f8(X8_400),f3(f8(X7_398),f5(f6(f7(c14)))))) ),
inference(resolution,[status(thm)],[c_6,c_2118]) ).
tff(c_5440,plain,
~ p2(f9(c17),c15),
inference(resolution,[status(thm)],[c_5434,c_38]) ).
tff(c_5447,plain,
( ~ p12(c15)
| p11(c15,c16) ),
inference(resolution,[status(thm)],[c_167,c_5440]) ).
tff(c_5453,plain,
p11(c15,c16),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_5447]) ).
tff(c_5455,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_615,c_5453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN573-1 : TPTP v8.1.2. Released v2.5.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.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 17:13:08 EDT 2023
% 0.16/0.37 % CPUTime :
% 7.85/2.98 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.85/2.98
% 7.85/2.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.85/3.01
% 7.85/3.01 Inference rules
% 7.85/3.01 ----------------------
% 7.85/3.01 #Ref : 0
% 7.85/3.01 #Sup : 1461
% 7.85/3.01 #Fact : 0
% 7.85/3.01 #Define : 0
% 7.85/3.01 #Split : 3
% 7.85/3.01 #Chain : 0
% 7.85/3.01 #Close : 0
% 7.85/3.01
% 7.85/3.01 Ordering : KBO
% 7.85/3.01
% 7.85/3.01 Simplification rules
% 7.85/3.01 ----------------------
% 7.85/3.01 #Subsume : 296
% 7.85/3.01 #Demod : 323
% 7.85/3.01 #Tautology : 187
% 7.85/3.01 #SimpNegUnit : 1
% 7.85/3.01 #BackRed : 0
% 7.85/3.01
% 7.85/3.01 #Partial instantiations: 0
% 7.85/3.01 #Strategies tried : 1
% 7.85/3.01
% 7.85/3.01 Timing (in seconds)
% 7.85/3.01 ----------------------
% 7.85/3.01 Preprocessing : 0.46
% 7.85/3.01 Parsing : 0.26
% 7.85/3.01 CNF conversion : 0.03
% 7.85/3.01 Main loop : 1.41
% 7.85/3.02 Inferencing : 0.44
% 7.85/3.02 Reduction : 0.36
% 7.85/3.02 Demodulation : 0.24
% 7.85/3.02 BG Simplification : 0.04
% 7.85/3.02 Subsumption : 0.47
% 7.85/3.02 Abstraction : 0.05
% 7.85/3.02 MUC search : 0.00
% 7.85/3.02 Cooper : 0.00
% 7.85/3.02 Total : 1.92
% 7.85/3.02 Index Insertion : 0.00
% 7.85/3.02 Index Deletion : 0.00
% 7.85/3.02 Index Matching : 0.00
% 7.85/3.02 BG Taut test : 0.00
%------------------------------------------------------------------------------