TSTP Solution File: SYN590-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN590-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 : n022.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:23 EDT 2023
% Result : Unsatisfiable 5.92s 2.47s
% Output : CNFRefutation 5.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 25
% Syntax : Number of formulae : 46 ( 12 unt; 17 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 58 ( 32 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 11 >; 5 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-1 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p5 > p3 > p2 > p12 > p10 > p11 > #nlpp > f9 > f8 > f7 > f6 > f4 > c18 > c17 > c16 > c15 > c14 > c13
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p11,type,
p11: $i > $o ).
tff(c16,type,
c16: $i ).
tff(f7,type,
f7: $i > $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c14,type,
c14: $i ).
tff(c17,type,
c17: $i ).
tff(p5,type,
p5: ( $i * $i ) > $o ).
tff(c15,type,
c15: $i ).
tff(f6,type,
f6: $i > $i ).
tff(p3,type,
p3: ( $i * $i ) > $o ).
tff(f9,type,
f9: $i > $i ).
tff(c18,type,
c18: $i ).
tff(f8,type,
f8: $i > $i ).
tff(p10,type,
p10: ( $i * $i ) > $o ).
tff(f4,type,
f4: $i > $i ).
tff(c13,type,
c13: $i ).
tff(p12,type,
p12: ( $i * $i ) > $o ).
tff(f_24,axiom,
p11(c16),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X4] :
( p11(f9(X4))
| ~ p11(X4) ),
file(unknown,unknown) ).
tff(f_85,axiom,
! [X24] :
( p3(f4(X24),f6(f8(X24)))
| ~ p11(X24) ),
file(unknown,unknown) ).
tff(f_32,axiom,
p3(f4(c16),f6(c15)),
file(unknown,unknown) ).
tff(f_90,axiom,
! [X4] :
( p10(f4(f9(X4)),f4(X4))
| ~ p11(X4) ),
file(unknown,unknown) ).
tff(f_144,axiom,
! [X0,X1,X2,X3] :
( p10(X0,X1)
| ~ p3(X2,X0)
| ~ p3(X3,X1)
| ~ p10(X2,X3) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X5,X6] :
( p12(X5,X6)
| ~ p10(f6(X5),f6(X6)) ),
file(unknown,unknown) ).
tff(f_133,axiom,
! [X34,X35] :
( ~ p11(X34)
| ~ p12(X35,c15)
| ~ p3(f4(X34),f6(X35)) ),
file(unknown,unknown) ).
tff(c_6,plain,
p11(c16),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_18,plain,
! [X4_4] :
( ~ p11(X4_4)
| p11(f9(X4_4)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_36,plain,
! [X24_21] :
( ~ p11(X24_21)
| p3(f4(X24_21),f6(f8(X24_21))) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_16,plain,
p3(f4(c16),f6(c15)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_38,plain,
! [X4_22] :
( ~ p11(X4_22)
| p10(f4(f9(X4_22)),f4(X4_22)) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_226,plain,
! [X2_88,X3_89,X1_90,X0_91] :
( ~ p10(X2_88,X3_89)
| ~ p3(X3_89,X1_90)
| ~ p3(X2_88,X0_91)
| p10(X0_91,X1_90) ),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_1448,plain,
! [X4_170,X1_171,X0_172] :
( ~ p3(f4(X4_170),X1_171)
| ~ p3(f4(f9(X4_170)),X0_172)
| p10(X0_172,X1_171)
| ~ p11(X4_170) ),
inference(resolution,[status(thm)],[c_38,c_226]) ).
tff(c_1487,plain,
! [X0_172] :
( ~ p3(f4(f9(c16)),X0_172)
| p10(X0_172,f6(c15))
| ~ p11(c16) ),
inference(resolution,[status(thm)],[c_16,c_1448]) ).
tff(c_1673,plain,
! [X0_177] :
( ~ p3(f4(f9(c16)),X0_177)
| p10(X0_177,f6(c15)) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_1487]) ).
tff(c_1727,plain,
( p10(f6(f8(f9(c16))),f6(c15))
| ~ p11(f9(c16)) ),
inference(resolution,[status(thm)],[c_36,c_1673]) ).
tff(c_2898,plain,
~ p11(f9(c16)),
inference(splitLeft,[status(thm)],[c_1727]) ).
tff(c_2901,plain,
~ p11(c16),
inference(resolution,[status(thm)],[c_18,c_2898]) ).
tff(c_2905,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2901]) ).
tff(c_2907,plain,
p11(f9(c16)),
inference(splitRight,[status(thm)],[c_1727]) ).
tff(c_2906,plain,
p10(f6(f8(f9(c16))),f6(c15)),
inference(splitRight,[status(thm)],[c_1727]) ).
tff(c_22,plain,
! [X5_7,X6_8] :
( ~ p10(f6(X5_7),f6(X6_8))
| p12(X5_7,X6_8) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_2934,plain,
p12(f8(f9(c16)),c15),
inference(resolution,[status(thm)],[c_2906,c_22]) ).
tff(c_182,plain,
! [X34_84,X35_85] :
( ~ p3(f4(X34_84),f6(X35_85))
| ~ p12(X35_85,c15)
| ~ p11(X34_84) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_192,plain,
! [X24_21] :
( ~ p12(f8(X24_21),c15)
| ~ p11(X24_21) ),
inference(resolution,[status(thm)],[c_36,c_182]) ).
tff(c_2961,plain,
~ p11(f9(c16)),
inference(resolution,[status(thm)],[c_2934,c_192]) ).
tff(c_2970,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2907,c_2961]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN590-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/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.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:12:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.92/2.47 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.92/2.47
% 5.92/2.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.92/2.50
% 5.92/2.50 Inference rules
% 5.92/2.50 ----------------------
% 5.92/2.50 #Ref : 0
% 5.92/2.50 #Sup : 672
% 5.92/2.50 #Fact : 0
% 5.92/2.50 #Define : 0
% 5.92/2.50 #Split : 17
% 5.92/2.50 #Chain : 0
% 5.92/2.50 #Close : 0
% 5.92/2.50
% 5.92/2.50 Ordering : KBO
% 5.92/2.50
% 5.92/2.50 Simplification rules
% 5.92/2.50 ----------------------
% 5.92/2.50 #Subsume : 97
% 5.92/2.50 #Demod : 179
% 5.92/2.50 #Tautology : 97
% 5.92/2.50 #SimpNegUnit : 0
% 5.92/2.50 #BackRed : 0
% 5.92/2.50
% 5.92/2.50 #Partial instantiations: 0
% 5.92/2.50 #Strategies tried : 1
% 5.92/2.50
% 5.92/2.50 Timing (in seconds)
% 5.92/2.50 ----------------------
% 5.92/2.50 Preprocessing : 0.48
% 5.92/2.50 Parsing : 0.26
% 5.92/2.51 CNF conversion : 0.03
% 5.92/2.51 Main loop : 0.96
% 5.92/2.51 Inferencing : 0.35
% 5.92/2.51 Reduction : 0.27
% 5.92/2.51 Demodulation : 0.19
% 5.92/2.51 BG Simplification : 0.03
% 5.92/2.51 Subsumption : 0.24
% 5.92/2.51 Abstraction : 0.03
% 5.92/2.51 MUC search : 0.00
% 5.92/2.51 Cooper : 0.00
% 5.92/2.51 Total : 1.49
% 5.92/2.51 Index Insertion : 0.00
% 5.92/2.51 Index Deletion : 0.00
% 5.92/2.51 Index Matching : 0.00
% 5.92/2.51 BG Taut test : 0.00
%------------------------------------------------------------------------------