TSTP Solution File: LCL899+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL899+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/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 : n028.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:14 EDT 2023
% Result : Theorem 3.88s 1.98s
% Output : CNFRefutation 3.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL899+1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13 % 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.17/0.35 % Computer : n028.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 14:08:38 EDT 2023
% 0.17/0.35 % CPUTime :
% 3.88/1.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/1.99
% 3.88/1.99 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/2.01 %$ >= > ==> > + > #nlpp > 1 > 0 > #skF_1
% 3.88/2.01
% 3.88/2.01 %Foreground sorts:
% 3.88/2.01
% 3.88/2.01
% 3.88/2.01 %Background operators:
% 3.88/2.01
% 3.88/2.01
% 3.88/2.01 %Foreground operators:
% 3.88/2.01 tff(==>, type, ==>: ($i * $i) > $i).
% 3.88/2.01 tff(+, type, +: ($i * $i) > $i).
% 3.88/2.01 tff(>=, type, >=: ($i * $i) > $o).
% 3.88/2.01 tff(0, type, 0: $i).
% 3.88/2.01 tff('#skF_1', type, '#skF_1': $i).
% 3.88/2.01 tff(1, type, 1: $i).
% 3.88/2.01
% 3.88/2.02 tff(f_34, axiom, (![A]: >=(A, A)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_04)).
% 3.88/2.02 tff(f_32, axiom, (![A]: (+(A, 0) = A)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_03)).
% 3.88/2.02 tff(f_30, axiom, (![A, B]: (+(A, B) = +(B, A))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_02)).
% 3.88/2.02 tff(f_50, axiom, (![X5, X6, X7]: (>=(+(X5, X6), X7) <=> >=(X6, ==>(X5, X7)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_07)).
% 3.88/2.02 tff(f_46, axiom, (![X3, X4]: ((>=(X3, X4) & >=(X4, X3)) => (X3 = X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_06)).
% 3.88/2.02 tff(f_52, axiom, (![A]: >=(A, 0)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_08)).
% 3.88/2.02 tff(f_66, axiom, (![A]: (+(A, 1) = 1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_12)).
% 3.88/2.02 tff(f_68, axiom, (![A, B]: (==>(==>(A, B), B) = ==>(==>(B, A), A))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', sos_13)).
% 3.88/2.02 tff(f_71, negated_conjecture, ~(![X17]: (==>(==>(X17, 1), 1) = X17)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', goals_14)).
% 3.88/2.02 tff(c_8, plain, (![A_7]: (>=(A_7, A_7))), inference(cnfTransformation, [status(thm)], [f_34])).
% 3.88/2.02 tff(c_6, plain, (![A_6]: (+(A_6, 0)=A_6)), inference(cnfTransformation, [status(thm)], [f_32])).
% 3.88/2.02 tff(c_49, plain, (![B_33, A_34]: (+(B_33, A_34)=+(A_34, B_33))), inference(cnfTransformation, [status(thm)], [f_30])).
% 3.88/2.02 tff(c_95, plain, (![A_6]: (+(0, A_6)=A_6)), inference(superposition, [status(thm), theory('equality')], [c_6, c_49])).
% 3.88/2.02 tff(c_324, plain, (![X5_52, X6_53, X7_54]: (>=(+(X5_52, X6_53), X7_54) | ~>=(X6_53, ==>(X5_52, X7_54)))), inference(cnfTransformation, [status(thm)], [f_50])).
% 3.88/2.02 tff(c_354, plain, (![A_59, X7_60]: (>=(A_59, X7_60) | ~>=(A_59, ==>(0, X7_60)))), inference(superposition, [status(thm), theory('equality')], [c_95, c_324])).
% 3.88/2.02 tff(c_374, plain, (![X7_60]: (>=(==>(0, X7_60), X7_60))), inference(resolution, [status(thm)], [c_8, c_354])).
% 3.88/2.02 tff(c_387, plain, (![X6_62, X5_63, X7_64]: (>=(X6_62, ==>(X5_63, X7_64)) | ~>=(+(X5_63, X6_62), X7_64))), inference(cnfTransformation, [status(thm)], [f_50])).
% 3.88/2.02 tff(c_505, plain, (![X6_68, X5_69]: (>=(X6_68, ==>(X5_69, +(X5_69, X6_68))))), inference(resolution, [status(thm)], [c_8, c_387])).
% 3.88/2.02 tff(c_720, plain, (![A_74]: (>=(A_74, ==>(0, A_74)))), inference(superposition, [status(thm), theory('equality')], [c_95, c_505])).
% 3.88/2.02 tff(c_12, plain, (![X4_12, X3_11]: (X4_12=X3_11 | ~>=(X4_12, X3_11) | ~>=(X3_11, X4_12))), inference(cnfTransformation, [status(thm)], [f_46])).
% 3.88/2.02 tff(c_739, plain, (![A_74]: (==>(0, A_74)=A_74 | ~>=(==>(0, A_74), A_74))), inference(resolution, [status(thm)], [c_720, c_12])).
% 3.88/2.02 tff(c_758, plain, (![A_74]: (==>(0, A_74)=A_74)), inference(demodulation, [status(thm), theory('equality')], [c_374, c_739])).
% 3.88/2.02 tff(c_18, plain, (![A_16]: (>=(A_16, 0))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.88/2.02 tff(c_201, plain, (![X4_37, X3_38]: (X4_37=X3_38 | ~>=(X4_37, X3_38) | ~>=(X3_38, X4_37))), inference(cnfTransformation, [status(thm)], [f_46])).
% 3.88/2.02 tff(c_210, plain, (![A_16]: (A_16=0 | ~>=(0, A_16))), inference(resolution, [status(thm)], [c_18, c_201])).
% 3.88/2.02 tff(c_525, plain, (![X5_69]: (==>(X5_69, +(X5_69, 0))=0)), inference(resolution, [status(thm)], [c_505, c_210])).
% 3.88/2.02 tff(c_655, plain, (![X5_72]: (==>(X5_72, X5_72)=0)), inference(demodulation, [status(thm), theory('equality')], [c_6, c_525])).
% 3.88/2.02 tff(c_26, plain, (![A_26]: (+(A_26, 1)=1)), inference(cnfTransformation, [status(thm)], [f_66])).
% 3.88/2.02 tff(c_349, plain, (![X7_54, A_26]: (>=(1, X7_54) | ~>=(1, ==>(A_26, X7_54)))), inference(superposition, [status(thm), theory('equality')], [c_26, c_324])).
% 3.88/2.02 tff(c_671, plain, (![X5_72]: (>=(1, X5_72) | ~>=(1, 0))), inference(superposition, [status(thm), theory('equality')], [c_655, c_349])).
% 3.88/2.02 tff(c_698, plain, (![X5_72]: (>=(1, X5_72))), inference(demodulation, [status(thm), theory('equality')], [c_18, c_671])).
% 3.88/2.02 tff(c_1041, plain, (![A_86, X7_87]: (>=(0, ==>(A_86, X7_87)) | ~>=(A_86, X7_87))), inference(superposition, [status(thm), theory('equality')], [c_6, c_387])).
% 3.88/2.02 tff(c_1051, plain, (![A_86, X7_87]: (==>(A_86, X7_87)=0 | ~>=(==>(A_86, X7_87), 0) | ~>=(A_86, X7_87))), inference(resolution, [status(thm)], [c_1041, c_12])).
% 3.88/2.02 tff(c_1109, plain, (![A_90, X7_91]: (==>(A_90, X7_91)=0 | ~>=(A_90, X7_91))), inference(demodulation, [status(thm), theory('equality')], [c_18, c_1051])).
% 3.88/2.02 tff(c_1161, plain, (![X5_92]: (==>(1, X5_92)=0)), inference(resolution, [status(thm)], [c_698, c_1109])).
% 3.88/2.02 tff(c_28, plain, (![B_28, A_27]: (==>(==>(B_28, A_27), A_27)===>(==>(A_27, B_28), B_28))), inference(cnfTransformation, [status(thm)], [f_68])).
% 3.88/2.02 tff(c_1175, plain, (![X5_92]: (==>(==>(X5_92, 1), 1)===>(0, X5_92))), inference(superposition, [status(thm), theory('equality')], [c_1161, c_28])).
% 3.88/2.02 tff(c_1213, plain, (![X5_92]: (==>(==>(X5_92, 1), 1)=X5_92)), inference(demodulation, [status(thm), theory('equality')], [c_758, c_1175])).
% 3.88/2.02 tff(c_30, plain, (==>(==>('#skF_1', 1), 1)!='#skF_1'), inference(cnfTransformation, [status(thm)], [f_71])).
% 3.88/2.02 tff(c_1478, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1213, c_30])).
% 3.88/2.02 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/2.02
% 3.88/2.02 Inference rules
% 3.88/2.02 ----------------------
% 3.88/2.02 #Ref : 0
% 3.88/2.02 #Sup : 345
% 3.88/2.02 #Fact : 0
% 3.88/2.02 #Define : 0
% 3.88/2.02 #Split : 0
% 3.88/2.02 #Chain : 0
% 3.88/2.02 #Close : 0
% 3.88/2.02
% 3.88/2.02 Ordering : KBO
% 3.88/2.02
% 3.88/2.02 Simplification rules
% 3.88/2.02 ----------------------
% 3.88/2.02 #Subsume : 2
% 3.88/2.02 #Demod : 221
% 3.88/2.02 #Tautology : 224
% 3.88/2.02 #SimpNegUnit : 0
% 3.88/2.02 #BackRed : 4
% 3.88/2.02
% 3.88/2.02 #Partial instantiations: 0
% 3.88/2.02 #Strategies tried : 1
% 3.88/2.02
% 3.88/2.02 Timing (in seconds)
% 3.88/2.02 ----------------------
% 3.88/2.02 Preprocessing : 0.45
% 3.88/2.02 Parsing : 0.25
% 3.88/2.02 CNF conversion : 0.03
% 3.88/2.02 Main loop : 0.52
% 3.88/2.02 Inferencing : 0.19
% 3.88/2.02 Reduction : 0.17
% 3.88/2.02 Demodulation : 0.14
% 3.88/2.02 BG Simplification : 0.02
% 3.88/2.02 Subsumption : 0.10
% 3.88/2.02 Abstraction : 0.02
% 3.88/2.02 MUC search : 0.00
% 3.88/2.02 Cooper : 0.00
% 3.88/2.02 Total : 1.02
% 3.88/2.02 Index Insertion : 0.00
% 3.88/2.02 Index Deletion : 0.00
% 3.88/2.02 Index Matching : 0.00
% 3.88/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------