TSTP Solution File: ITP349_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ITP001_1 : TPTP v8.1.2. Released v8.1.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 : n020.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:44:31 EDT 2023
% Result : Theorem 9.29s 3.18s
% Output : CNFRefutation 9.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ITP001_1 : TPTP v8.1.2. Released v8.1.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.15/0.37 % Computer : n020.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 19:01:22 EDT 2023
% 0.15/0.37 % CPUTime :
% 9.29/3.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.29/3.19
% 9.29/3.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.29/3.21 %$ member$ > fun_app$ > eventually$ > uue$ > uud$ > uuo$ > uul$ > uuk$ > uuj$ > uui$ > uuh$ > uuf$ > uuc$ > greaterThanLessThan$ > fun_app$b > fun_app$a > #nlpp > uup$ > uug$ > uub$ > times$ > divide$ > collect$ > uun$ > uum$ > uua$ > uu$ > tanh$ > rfloor$ > rceil$ > ln$ > lambert_W$ > exp$ > at_top$ > a$ > #skF_21 > #skF_11 > #skF_5 > #skF_25 > #skF_1 > #skF_2 > #skF_8 > #skF_22 > #skF_7 > #skF_28 > #skF_20 > #skF_3 > #skF_10 > #skF_19 > #skF_12 > #skF_24 > #skF_13 > #skF_26 > #skF_18 > #skF_16 > #skF_27 > #skF_29 > #skF_30 > #skF_23 > #skF_14 > #skF_6 > #skF_15 > #skF_9 > #skF_4 > #skF_17
% 9.29/3.21
% 9.29/3.21 %Foreground sorts:
% 9.29/3.21 tff(Real_real_bool_fun_fun$, type, Real_real_bool_fun_fun$: $tType ).
% 9.29/3.21 tff(Real_set$, type, Real_set$: $tType ).
% 9.29/3.21 tff(Real_filter$, type, Real_filter$: $tType ).
% 9.29/3.21 tff(Real_bool_fun$, type, Real_bool_fun$: $tType ).
% 9.29/3.21 tff(Real_real_fun$, type, Real_real_fun$: $tType ).
% 9.29/3.21
% 9.29/3.21 %Background operators:
% 9.29/3.21 tff(c$, type, c$: $real).
% 9.29/3.21
% 9.29/3.21 %Foreground operators:
% 9.29/3.21 tff('#skF_21', type, '#skF_21': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_11', type, '#skF_11': (Real_real_bool_fun_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_5', type, '#skF_5': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff(divide$, type, divide$: $real > Real_real_fun$).
% 9.29/3.21 tff('#skF_25', type, '#skF_25': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff(uuc$, type, uuc$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff('#skF_1', type, '#skF_1': (Real_bool_fun$ * Real_bool_fun$) > $real).
% 9.29/3.21 tff(fun_app$, type, fun_app$: (Real_bool_fun$ * $real) > $o).
% 9.29/3.21 tff('#skF_2', type, '#skF_2': (Real_bool_fun$ * Real_bool_fun$) > $real).
% 9.29/3.21 tff(tanh$, type, tanh$: Real_real_fun$).
% 9.29/3.21 tff('#skF_8', type, '#skF_8': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(uuj$, type, uuj$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff(eventually$, type, eventually$: (Real_bool_fun$ * Real_filter$) > $o).
% 9.29/3.21 tff(collect$, type, collect$: Real_bool_fun$ > Real_set$).
% 9.29/3.21 tff(uun$, type, uun$: Real_real_fun$).
% 9.29/3.21 tff(uu$, type, uu$: Real_bool_fun$).
% 9.29/3.21 tff(uul$, type, uul$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff('#skF_22', type, '#skF_22': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_7', type, '#skF_7': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(uuf$, type, uuf$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff(fun_app$a, type, fun_app$a: (Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(a$, type, a$: Real_real_fun$).
% 9.29/3.21 tff(uua$, type, uua$: Real_bool_fun$).
% 9.29/3.21 tff('#skF_28', type, '#skF_28': ($real * $real * $real) > $real).
% 9.29/3.21 tff('#skF_20', type, '#skF_20': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(rfloor$, type, rfloor$: Real_real_fun$).
% 9.29/3.21 tff('#skF_3', type, '#skF_3': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff('#skF_10', type, '#skF_10': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_19', type, '#skF_19': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(uui$, type, uui$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff(member$, type, member$: ($real * Real_set$) > $o).
% 9.29/3.21 tff('#skF_12', type, '#skF_12': (Real_real_bool_fun_fun$ * $real * $real) > $real).
% 9.29/3.21 tff(greaterThanLessThan$, type, greaterThanLessThan$: ($real * $real) > Real_set$).
% 9.29/3.21 tff(uuh$, type, uuh$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff('#skF_24', type, '#skF_24': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(rceil$, type, rceil$: Real_real_fun$).
% 9.29/3.21 tff('#skF_13', type, '#skF_13': (Real_real_bool_fun_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_26', type, '#skF_26': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_18', type, '#skF_18': $real > $real).
% 9.29/3.21 tff(uug$, type, uug$: Real_real_fun$ > Real_bool_fun$).
% 9.29/3.21 tff(uup$, type, uup$: $real > Real_real_fun$).
% 9.29/3.21 tff('#skF_16', type, '#skF_16': Real_set$ > $real).
% 9.29/3.21 tff('#skF_27', type, '#skF_27': ($real * $real * $real) > $real).
% 9.29/3.21 tff('#skF_29', type, '#skF_29': ($real * $real) > $real).
% 9.29/3.21 tff('#skF_30', type, '#skF_30': ($real * $real) > $real).
% 9.29/3.21 tff(exp$, type, exp$: Real_real_fun$).
% 9.29/3.21 tff(uub$, type, uub$: Real_set$ > Real_bool_fun$).
% 9.29/3.21 tff('#skF_23', type, '#skF_23': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(fun_app$b, type, fun_app$b: (Real_real_bool_fun_fun$ * $real) > Real_bool_fun$).
% 9.29/3.21 tff(uue$, type, uue$: (Real_real_fun$ * Real_real_fun$ * Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff('#skF_14', type, '#skF_14': (Real_real_bool_fun_fun$ * $real * $real) > $real).
% 9.29/3.21 tff(uum$, type, uum$: Real_real_fun$).
% 9.29/3.21 tff(ln$, type, ln$: Real_real_fun$).
% 9.29/3.21 tff(lambert_W$, type, lambert_W$: Real_real_fun$).
% 9.29/3.21 tff(uuo$, type, uuo$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff('#skF_6', type, '#skF_6': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff('#skF_15', type, '#skF_15': (Real_set$ * $real) > $real).
% 9.29/3.21 tff('#skF_9', type, '#skF_9': ($real * Real_real_fun$ * $real * $real) > $real).
% 9.29/3.21 tff(uuk$, type, uuk$: (Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff(uud$, type, uud$: (Real_real_fun$ * Real_real_fun$ * Real_real_fun$ * Real_real_fun$) > Real_bool_fun$).
% 9.29/3.21 tff('#skF_4', type, '#skF_4': ($real * $real * Real_real_fun$ * $real) > $real).
% 9.29/3.21 tff(times$, type, times$: $real > Real_real_fun$).
% 9.29/3.21 tff('#skF_17', type, '#skF_17': (Real_set$ * $real) > $real).
% 9.29/3.21 tff(at_top$, type, at_top$: Real_filter$).
% 9.29/3.21
% 9.29/3.21 tff(f_1646, axiom, (![A__questionmark_v0a:$real]: ($difference(0, A__questionmark_v0a) = $uminus(A__questionmark_v0a))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom323)).
% 9.29/3.21 tff(f_1285, axiom, (![A__questionmark_v0a:$real]: ((A__questionmark_v0a = $uminus(A__questionmark_v0a)) <=> (A__questionmark_v0a = 0))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom254)).
% 9.29/3.21 tff(c_1036, plain, (![A__questionmark_v0_730a:$real]: ($uminus(A__questionmark_v0_730a)=$difference(0, A__questionmark_v0_730a))), inference(cnfTransformation, [status(thm)], [f_1646])).
% 9.29/3.21 tff(c_803, plain, (![A__questionmark_v0_623a:$real]: ($uminus(A__questionmark_v0_623a)!=A__questionmark_v0_623a | A__questionmark_v0_623a=0)), inference(cnfTransformation, [status(thm)], [f_1285])).
% 9.29/3.21 tff(c_1666, plain, (![A__questionmark_v0_623a:$real]: ($difference(0, A__questionmark_v0_623a)!=A__questionmark_v0_623a | A__questionmark_v0_623a=0)), inference(demodulation, [status(thm), theory('equality')], [c_1036, c_803])).
% 9.29/3.21 tff(c_1668, plain, (![A__questionmark_v0_623a:$real]: (A__questionmark_v0_623a=0)), inference(backgroundSimplification, [status(thm), theory('LFA')], [c_1666])).
% 9.29/3.21 tff(c_1993, plain, $false, inference(quantifierElimination, [status(thm), theory('LFA')], [c_1668])).
% 9.29/3.21 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.29/3.21
% 9.29/3.21 Inference rules
% 9.29/3.21 ----------------------
% 9.29/3.21 #Ref : 0
% 9.29/3.21 #Sup : 0
% 9.29/3.21 #Fact : 0
% 9.29/3.21 #Define : 0
% 9.29/3.21 #Split : 0
% 9.29/3.21 #Chain : 0
% 9.29/3.21 #Close : 0
% 9.29/3.21
% 9.29/3.21 Ordering : LPO
% 9.29/3.21
% 9.29/3.21 Simplification rules
% 9.29/3.21 ----------------------
% 9.29/3.21 #Subsume : 345
% 9.29/3.21 #Demod : 387
% 9.29/3.21 #Tautology : 156
% 9.29/3.21 #SimpNegUnit : 0
% 9.29/3.21 #BackRed : 0
% 9.29/3.21
% 9.29/3.21 #Partial instantiations: 0
% 9.29/3.21 #Strategies tried : 1
% 9.29/3.21
% 9.29/3.21 Timing (in seconds)
% 9.29/3.21 ----------------------
% 9.29/3.21 Preprocessing : 1.43
% 9.29/3.21 Parsing : 0.71
% 9.29/3.21 CNF conversion : 0.12
% 9.29/3.22 Main loop : 0.69
% 9.29/3.22 Inferencing : 0.00
% 9.29/3.22 Reduction : 0.40
% 9.29/3.22 Demodulation : 0.32
% 9.29/3.22 BG Simplification : 0.19
% 9.29/3.22 Subsumption : 0.17
% 9.29/3.22 Abstraction : 0.03
% 9.29/3.22 MUC search : 0.00
% 9.29/3.22 Cooper : 0.00
% 9.29/3.22 Total : 2.16
% 9.29/3.22 Index Insertion : 0.00
% 9.29/3.22 Index Deletion : 0.00
% 9.29/3.22 Index Matching : 0.00
% 9.29/3.22 BG Taut test : 0.00
%------------------------------------------------------------------------------