TSTP Solution File: LCL893+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL893+1 : TPTP v8.1.2. Released v5.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 : n017.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 10:49:13 EDT 2023
% Result : Theorem 3.31s 1.86s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL893+1 : TPTP v8.1.2. Released v5.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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 13:08:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.31/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.31/1.86
% 3.31/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.31/1.88 %$ >= > ==> > + > #nlpp > h > 1 > 0 > #skF_1
% 3.31/1.88
% 3.31/1.88 %Foreground sorts:
% 3.31/1.88
% 3.31/1.88
% 3.31/1.88 %Background operators:
% 3.31/1.88
% 3.31/1.88
% 3.31/1.88 %Foreground operators:
% 3.31/1.88 tff(==>, type, ==>: ($i * $i) > $i).
% 3.31/1.88 tff(+, type, +: ($i * $i) > $i).
% 3.31/1.88 tff(>=, type, >=: ($i * $i) > $o).
% 3.31/1.88 tff(0, type, 0: $i).
% 3.31/1.88 tff('#skF_1', type, '#skF_1': $i).
% 3.31/1.88 tff(h, type, h: $i > $i).
% 3.31/1.88 tff(1, type, 1: $i).
% 3.31/1.88
% 3.35/1.89 tff(f_74, negated_conjecture, ~(![X17]: ((h(X17) = X17) => (X17 = 0))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', goals_15)).
% 3.35/1.89 tff(f_31, axiom, (![A]: (+(A, 0) = A)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_03)).
% 3.35/1.89 tff(f_35, axiom, (![A]: >=(A, A)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_05)).
% 3.35/1.89 tff(f_51, axiom, (![X5, X6, X7]: (>=(+(X5, X6), X7) <=> >=(X6, ==>(X5, X7)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_08)).
% 3.35/1.89 tff(f_53, axiom, (![A]: >=(A, 0)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_09)).
% 3.35/1.89 tff(f_47, axiom, (![X3, X4]: ((>=(X3, X4) & >=(X4, X3)) => (X3 = X4))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_07)).
% 3.35/1.89 tff(f_69, axiom, (![A]: (h(A) = ==>(h(A), A))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', sos_14)).
% 3.35/1.89 tff(c_32, plain, (0!='#skF_1'), inference(cnfTransformation, [status(thm)], [f_74])).
% 3.35/1.89 tff(c_6, plain, (![A_6]: (+(A_6, 0)=A_6)), inference(cnfTransformation, [status(thm)], [f_31])).
% 3.35/1.89 tff(c_10, plain, (![A_8]: (>=(A_8, A_8))), inference(cnfTransformation, [status(thm)], [f_35])).
% 3.35/1.89 tff(c_249, plain, (![X6_44, X5_45, X7_46]: (>=(X6_44, ==>(X5_45, X7_46)) | ~>=(+(X5_45, X6_44), X7_46))), inference(cnfTransformation, [status(thm)], [f_51])).
% 3.35/1.89 tff(c_367, plain, (![X6_54, X5_55]: (>=(X6_54, ==>(X5_55, +(X5_55, X6_54))))), inference(resolution, [status(thm)], [c_10, c_249])).
% 3.35/1.89 tff(c_20, plain, (![A_17]: (>=(A_17, 0))), inference(cnfTransformation, [status(thm)], [f_53])).
% 3.35/1.89 tff(c_135, plain, (![X4_37, X3_38]: (X4_37=X3_38 | ~>=(X4_37, X3_38) | ~>=(X3_38, X4_37))), inference(cnfTransformation, [status(thm)], [f_47])).
% 3.35/1.89 tff(c_144, plain, (![A_17]: (A_17=0 | ~>=(0, A_17))), inference(resolution, [status(thm)], [c_20, c_135])).
% 3.35/1.89 tff(c_371, plain, (![X5_55]: (==>(X5_55, +(X5_55, 0))=0)), inference(resolution, [status(thm)], [c_367, c_144])).
% 3.35/1.89 tff(c_403, plain, (![X5_56]: (==>(X5_56, X5_56)=0)), inference(demodulation, [status(thm), theory('equality')], [c_6, c_371])).
% 3.35/1.89 tff(c_34, plain, (h('#skF_1')='#skF_1'), inference(cnfTransformation, [status(thm)], [f_74])).
% 3.35/1.89 tff(c_57, plain, (![A_34]: (==>(h(A_34), A_34)=h(A_34))), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.35/1.89 tff(c_66, plain, (==>('#skF_1', '#skF_1')=h('#skF_1')), inference(superposition, [status(thm), theory('equality')], [c_34, c_57])).
% 3.35/1.89 tff(c_69, plain, (==>('#skF_1', '#skF_1')='#skF_1'), inference(demodulation, [status(thm), theory('equality')], [c_34, c_66])).
% 3.35/1.89 tff(c_416, plain, (0='#skF_1'), inference(superposition, [status(thm), theory('equality')], [c_403, c_69])).
% 3.35/1.89 tff(c_428, plain, $false, inference(negUnitSimplification, [status(thm)], [c_32, c_416])).
% 3.35/1.89 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.35/1.89
% 3.35/1.89 Inference rules
% 3.35/1.89 ----------------------
% 3.35/1.89 #Ref : 0
% 3.35/1.89 #Sup : 99
% 3.35/1.89 #Fact : 0
% 3.35/1.89 #Define : 0
% 3.35/1.89 #Split : 0
% 3.35/1.89 #Chain : 0
% 3.35/1.89 #Close : 0
% 3.35/1.89
% 3.35/1.89 Ordering : KBO
% 3.35/1.89
% 3.35/1.89 Simplification rules
% 3.35/1.89 ----------------------
% 3.35/1.89 #Subsume : 0
% 3.35/1.89 #Demod : 29
% 3.35/1.89 #Tautology : 62
% 3.35/1.89 #SimpNegUnit : 1
% 3.35/1.89 #BackRed : 1
% 3.35/1.89
% 3.35/1.89 #Partial instantiations: 0
% 3.35/1.89 #Strategies tried : 1
% 3.35/1.89
% 3.35/1.89 Timing (in seconds)
% 3.35/1.89 ----------------------
% 3.35/1.89 Preprocessing : 0.49
% 3.35/1.89 Parsing : 0.26
% 3.35/1.89 CNF conversion : 0.03
% 3.35/1.89 Main loop : 0.30
% 3.35/1.89 Inferencing : 0.11
% 3.35/1.89 Reduction : 0.10
% 3.35/1.89 Demodulation : 0.07
% 3.35/1.89 BG Simplification : 0.02
% 3.35/1.89 Subsumption : 0.06
% 3.35/1.89 Abstraction : 0.01
% 3.35/1.89 MUC search : 0.00
% 3.35/1.89 Cooper : 0.00
% 3.35/1.89 Total : 0.84
% 3.35/1.89 Index Insertion : 0.00
% 3.35/1.89 Index Deletion : 0.00
% 3.35/1.89 Index Matching : 0.00
% 3.35/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------