TSTP Solution File: SYO633-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYO633-1 : TPTP v8.1.2. Released v7.1.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:18:16 EDT 2023

% Result   : Unsatisfiable 3.07s 1.75s
% Output   : CNFRefutation 3.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYO633-1 : TPTP v8.1.2. Released v7.1.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.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 15:46:19 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 3.07/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.07/1.76  
% 3.07/1.76  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.07/1.78  %$ LEQ > E > AP > #nlpp > s > f > 0
% 3.07/1.78  
% 3.07/1.78  %Foreground sorts:
% 3.07/1.78  
% 3.07/1.78  
% 3.07/1.78  %Background operators:
% 3.07/1.78  
% 3.07/1.78  
% 3.07/1.78  %Foreground operators:
% 3.07/1.78  tff(s, type, s: $i > $i).
% 3.07/1.78  tff(AP, type, AP: ($i * $i) > $i).
% 3.07/1.78  tff(f, type, f: $i > $i).
% 3.07/1.78  tff(0, type, 0: $i).
% 3.07/1.78  tff(LEQ, type, LEQ: ($i * $i) > $o).
% 3.07/1.78  tff(E, type, E: ($i * $i) > $o).
% 3.07/1.78  
% 3.21/1.80  tff(f_68, axiom, (![B_0]: E(f(B_0), s(s(s(s(0)))))), file('unknown', unknown)).
% 3.21/1.80  tff(f_70, axiom, (![B]: E(f(B), s(s(s(s(s(0))))))), file('unknown', unknown)).
% 3.21/1.80  tff(f_113, axiom, (![A_0, B_0]: ((~E(f(A_0), s(s(s(s(0))))) | ~E(f(B_0), s(s(s(s(s(0))))))) | E(f(B_0), s(s(s(0)))))), file('unknown', unknown)).
% 3.21/1.80  tff(f_66, axiom, (![A_1, A_0, B_0, A_4, A_3, A_2]: (((((~E(f(A_2), s(s(0))) | ~E(f(A_0), s(s(s(s(0)))))) | ~E(f(A_1), s(s(s(0))))) | ~E(f(A_3), s(0))) | ~E(f(A_4), 0)) | ~E(f(B_0), s(s(s(s(s(0)))))))), file('unknown', unknown)).
% 3.21/1.80  tff(f_132, axiom, (![A_0, B_0, A_1, K]: (((~E(f(A_0), s(s(s(s(0))))) | ~E(f(B_0), s(s(s(s(s(0))))))) | ~E(f(A_1), s(s(s(0))))) | E(f(AP(s(s(s(s(s(s(0)))))), K)), s(s(0))))), file('unknown', unknown)).
% 3.21/1.80  tff(f_105, axiom, (![A_1, A_0, B_0, A_2, K]: ((((~E(f(A_0), s(s(s(s(0))))) | ~E(f(B_0), s(s(s(s(s(0))))))) | ~E(f(A_1), s(s(s(0))))) | ~E(f(A_2), s(s(0)))) | E(f(AP(s(s(s(s(s(s(0)))))), K)), s(0)))), file('unknown', unknown)).
% 3.21/1.80  tff(f_89, axiom, (![A_1, A_0, B_0, A_3, A_2, K]: (((((~E(f(A_2), s(s(0))) | ~E(f(A_0), s(s(s(s(0)))))) | ~E(f(A_1), s(s(s(0))))) | ~E(f(A_3), s(0))) | ~E(f(B_0), s(s(s(s(s(0))))))) | E(f(AP(s(s(s(s(s(s(0)))))), K)), 0))), file('unknown', unknown)).
% 3.21/1.80  tff(c_8, plain, (![B_0_16]: (E(f(B_0_16), s(s(s(s(0))))))), inference(cnfTransformation, [status(thm)], [f_68])).
% 3.21/1.80  tff(c_10, plain, (![B_17]: (E(f(B_17), s(s(s(s(s(0)))))))), inference(cnfTransformation, [status(thm)], [f_70])).
% 3.21/1.80  tff(c_20, plain, (![B_0_34, A_0_33]: (E(f(B_0_34), s(s(s(0)))) | ~E(f(B_0_34), s(s(s(s(s(0)))))) | ~E(f(A_0_33), s(s(s(s(0))))))), inference(cnfTransformation, [status(thm)], [f_113])).
% 3.21/1.80  tff(c_28, plain, (![B_0_34, A_0_33]: (E(f(B_0_34), s(s(s(0)))) | ~E(f(A_0_33), s(s(s(s(0))))))), inference(demodulation, [status(thm), theory('equality')], [c_10, c_20])).
% 3.21/1.80  tff(c_40, plain, (![B_0_34]: (E(f(B_0_34), s(s(s(0)))))), inference(demodulation, [status(thm), theory('equality')], [c_8, c_28])).
% 3.21/1.80  tff(c_6, plain, (![A_4_13, B_0_12, A_1_10, A_0_11, A_2_15, A_3_14]: (~E(f(B_0_12), s(s(s(s(s(0)))))) | ~E(f(A_4_13), 0) | ~E(f(A_3_14), s(0)) | ~E(f(A_1_10), s(s(s(0)))) | ~E(f(A_0_11), s(s(s(s(0))))) | ~E(f(A_2_15), s(s(0))))), inference(cnfTransformation, [status(thm)], [f_66])).
% 3.21/1.80  tff(c_60, plain, (![A_4_13, A_3_14, A_2_15]: (~E(f(A_4_13), 0) | ~E(f(A_3_14), s(0)) | ~E(f(A_2_15), s(s(0))))), inference(demodulation, [status(thm), theory('equality')], [c_8, c_40, c_10, c_6])).
% 3.21/1.80  tff(c_73, plain, (![A_2_15]: (~E(f(A_2_15), s(s(0))))), inference(splitLeft, [status(thm)], [c_60])).
% 3.21/1.80  tff(c_24, plain, (![K_41, A_1_40, B_0_39, A_0_38]: (E(f(AP(s(s(s(s(s(s(0)))))), K_41)), s(s(0))) | ~E(f(A_1_40), s(s(s(0)))) | ~E(f(B_0_39), s(s(s(s(s(0)))))) | ~E(f(A_0_38), s(s(s(s(0))))))), inference(cnfTransformation, [status(thm)], [f_132])).
% 3.21/1.80  tff(c_34, plain, (![K_41, A_1_40, A_0_38]: (E(f(AP(s(s(s(s(s(s(0)))))), K_41)), s(s(0))) | ~E(f(A_1_40), s(s(s(0)))) | ~E(f(A_0_38), s(s(s(s(0))))))), inference(demodulation, [status(thm), theory('equality')], [c_10, c_24])).
% 3.21/1.80  tff(c_46, plain, (![K_41, A_1_40]: (E(f(AP(s(s(s(s(s(s(0)))))), K_41)), s(s(0))) | ~E(f(A_1_40), s(s(s(0)))))), inference(demodulation, [status(thm), theory('equality')], [c_8, c_34])).
% 3.21/1.80  tff(c_54, plain, (![K_41]: (E(f(AP(s(s(s(s(s(s(0)))))), K_41)), s(s(0))))), inference(demodulation, [status(thm), theory('equality')], [c_40, c_46])).
% 3.21/1.80  tff(c_76, plain, $false, inference(negUnitSimplification, [status(thm)], [c_73, c_54])).
% 3.21/1.80  tff(c_77, plain, (![A_4_13, A_3_14]: (~E(f(A_4_13), 0) | ~E(f(A_3_14), s(0)))), inference(splitRight, [status(thm)], [c_60])).
% 3.21/1.80  tff(c_78, plain, (![A_3_14]: (~E(f(A_3_14), s(0)))), inference(splitLeft, [status(thm)], [c_77])).
% 3.21/1.80  tff(c_18, plain, (![K_32, A_1_28, A_0_29, B_0_30, A_2_31]: (E(f(AP(s(s(s(s(s(s(0)))))), K_32)), s(0)) | ~E(f(A_2_31), s(s(0))) | ~E(f(A_1_28), s(s(s(0)))) | ~E(f(B_0_30), s(s(s(s(s(0)))))) | ~E(f(A_0_29), s(s(s(s(0))))))), inference(cnfTransformation, [status(thm)], [f_105])).
% 3.21/1.80  tff(c_32, plain, (![K_32, A_2_31, A_1_28, A_0_29]: (E(f(AP(s(s(s(s(s(s(0)))))), K_32)), s(0)) | ~E(f(A_2_31), s(s(0))) | ~E(f(A_1_28), s(s(s(0)))) | ~E(f(A_0_29), s(s(s(s(0))))))), inference(demodulation, [status(thm), theory('equality')], [c_10, c_18])).
% 3.21/1.80  tff(c_44, plain, (![K_32, A_2_31, A_1_28]: (E(f(AP(s(s(s(s(s(s(0)))))), K_32)), s(0)) | ~E(f(A_2_31), s(s(0))) | ~E(f(A_1_28), s(s(s(0)))))), inference(demodulation, [status(thm), theory('equality')], [c_8, c_32])).
% 3.21/1.80  tff(c_52, plain, (![K_32, A_2_31]: (E(f(AP(s(s(s(s(s(s(0)))))), K_32)), s(0)) | ~E(f(A_2_31), s(s(0))))), inference(demodulation, [status(thm), theory('equality')], [c_40, c_44])).
% 3.21/1.80  tff(c_80, plain, (![A_2_31]: (~E(f(A_2_31), s(s(0))))), inference(negUnitSimplification, [status(thm)], [c_78, c_52])).
% 3.21/1.80  tff(c_82, plain, $false, inference(negUnitSimplification, [status(thm)], [c_80, c_54])).
% 3.21/1.80  tff(c_83, plain, (![A_4_13]: (~E(f(A_4_13), 0))), inference(splitRight, [status(thm)], [c_77])).
% 3.21/1.80  tff(c_14, plain, (![A_3_23, A_0_21, K_25, B_0_22, A_1_20, A_2_24]: (E(f(AP(s(s(s(s(s(s(0)))))), K_25)), 0) | ~E(f(B_0_22), s(s(s(s(s(0)))))) | ~E(f(A_3_23), s(0)) | ~E(f(A_1_20), s(s(s(0)))) | ~E(f(A_0_21), s(s(s(s(0))))) | ~E(f(A_2_24), s(s(0))))), inference(cnfTransformation, [status(thm)], [f_89])).
% 3.21/1.80  tff(c_36, plain, (![A_3_23, A_0_21, K_25, A_1_20, A_2_24]: (E(f(AP(s(s(s(s(s(s(0)))))), K_25)), 0) | ~E(f(A_3_23), s(0)) | ~E(f(A_1_20), s(s(s(0)))) | ~E(f(A_0_21), s(s(s(s(0))))) | ~E(f(A_2_24), s(s(0))))), inference(demodulation, [status(thm), theory('equality')], [c_10, c_14])).
% 3.21/1.80  tff(c_48, plain, (![K_25, A_3_23, A_1_20, A_2_24]: (E(f(AP(s(s(s(s(s(s(0)))))), K_25)), 0) | ~E(f(A_3_23), s(0)) | ~E(f(A_1_20), s(s(s(0)))) | ~E(f(A_2_24), s(s(0))))), inference(demodulation, [status(thm), theory('equality')], [c_8, c_36])).
% 3.21/1.80  tff(c_56, plain, (![K_25, A_3_23, A_2_24]: (E(f(AP(s(s(s(s(s(s(0)))))), K_25)), 0) | ~E(f(A_3_23), s(0)) | ~E(f(A_2_24), s(s(0))))), inference(demodulation, [status(thm), theory('equality')], [c_40, c_48])).
% 3.21/1.80  tff(c_95, plain, (![A_3_23, A_2_24]: (~E(f(A_3_23), s(0)) | ~E(f(A_2_24), s(s(0))))), inference(negUnitSimplification, [status(thm)], [c_83, c_56])).
% 3.21/1.80  tff(c_96, plain, (![A_2_24]: (~E(f(A_2_24), s(s(0))))), inference(splitLeft, [status(thm)], [c_95])).
% 3.21/1.80  tff(c_98, plain, $false, inference(negUnitSimplification, [status(thm)], [c_96, c_54])).
% 3.21/1.80  tff(c_99, plain, (![A_3_23]: (~E(f(A_3_23), s(0)))), inference(splitRight, [status(thm)], [c_95])).
% 3.21/1.80  tff(c_85, plain, (![A_2_31]: (~E(f(A_2_31), s(s(0))))), inference(splitLeft, [status(thm)], [c_52])).
% 3.21/1.80  tff(c_87, plain, $false, inference(negUnitSimplification, [status(thm)], [c_85, c_54])).
% 3.21/1.80  tff(c_88, plain, (![K_32]: (E(f(AP(s(s(s(s(s(s(0)))))), K_32)), s(0)))), inference(splitRight, [status(thm)], [c_52])).
% 3.21/1.80  tff(c_101, plain, $false, inference(negUnitSimplification, [status(thm)], [c_99, c_88])).
% 3.21/1.80  % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.21/1.80  
% 3.21/1.80  Inference rules
% 3.21/1.80  ----------------------
% 3.21/1.80  #Ref     : 0
% 3.21/1.80  #Sup     : 0
% 3.21/1.80  #Fact    : 0
% 3.21/1.80  #Define  : 0
% 3.21/1.80  #Split   : 6
% 3.21/1.80  #Chain   : 0
% 3.21/1.80  #Close   : 0
% 3.21/1.80  
% 3.21/1.80  Ordering : KBO
% 3.21/1.80  
% 3.21/1.80  Simplification rules
% 3.21/1.80  ----------------------
% 3.21/1.80  #Subsume      : 0
% 3.21/1.80  #Demod        : 25
% 3.21/1.80  #Tautology    : 0
% 3.21/1.80  #SimpNegUnit  : 8
% 3.21/1.80  #BackRed      : 6
% 3.21/1.80  
% 3.21/1.80  #Partial instantiations: 0
% 3.21/1.80  #Strategies tried      : 1
% 3.21/1.80  
% 3.21/1.80  Timing (in seconds)
% 3.21/1.80  ----------------------
% 3.21/1.80  Preprocessing        : 0.52
% 3.21/1.80  Parsing              : 0.28
% 3.21/1.80  CNF conversion       : 0.03
% 3.21/1.80  Main loop            : 0.22
% 3.21/1.80  Inferencing          : 0.05
% 3.21/1.80  Reduction            : 0.08
% 3.21/1.80  Demodulation         : 0.06
% 3.21/1.80  BG Simplification    : 0.02
% 3.21/1.80  Subsumption          : 0.05
% 3.21/1.80  Abstraction          : 0.01
% 3.21/1.80  MUC search           : 0.00
% 3.21/1.80  Cooper               : 0.00
% 3.21/1.81  Total                : 0.80
% 3.21/1.81  Index Insertion      : 0.00
% 3.21/1.81  Index Deletion       : 0.00
% 3.21/1.81  Index Matching       : 0.00
% 3.21/1.81  BG Taut test         : 0.00
%------------------------------------------------------------------------------