TSTP Solution File: ARI739_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI739_1 : TPTP v8.1.2. Released v7.0.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 : n029.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:34:18 EDT 2023
% Result : Theorem 3.34s 1.91s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 5 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 6 ( 0 atm; 0 fun; 4 num; 2 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 2 (; 2 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > log2 > log10 > log > exp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(log,type,
log: $real > $real ).
tff(log2,type,
log2: $real > $real ).
tff(exp,type,
exp: $real > $real ).
tff(log10,type,
log10: $real > $real ).
tff(f_39,axiom,
! [Xa: $real] : ( log(exp(Xa)) = Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',log_exp) ).
tff(f_49,negated_conjecture,
log(exp(1)) != 1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',log_e) ).
tff(c_9,plain,
! [X_5a: $real] : ( log(exp(X_5a)) = X_5a ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_16,plain,
log(exp(1)) != 1,
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_101,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI739_1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.13 % 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.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Fri Aug 4 00:27:23 EDT 2023
% 0.16/0.34 % CPUTime :
% 3.34/1.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.34/1.92
% 3.34/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.34/1.94
% 3.34/1.94 Inference rules
% 3.34/1.94 ----------------------
% 3.34/1.94 #Ref : 0
% 3.34/1.94 #Sup : 0
% 3.34/1.94 #Fact : 0
% 3.34/1.94 #Define : 0
% 3.34/1.94 #Split : 0
% 3.34/1.94 #Chain : 0
% 3.34/1.94 #Close : 0
% 3.34/1.94
% 3.34/1.94 Ordering : LPO
% 3.34/1.94
% 3.34/1.94 Simplification rules
% 3.34/1.94 ----------------------
% 3.34/1.94 #Subsume : 8
% 3.34/1.94 #Demod : 1
% 3.34/1.94 #Tautology : 1
% 3.34/1.94 #SimpNegUnit : 0
% 3.34/1.94 #BackRed : 0
% 3.34/1.94
% 3.34/1.94 #Partial instantiations: 0
% 3.34/1.94 #Strategies tried : 1
% 3.34/1.94
% 3.34/1.94 Timing (in seconds)
% 3.34/1.94 ----------------------
% 3.34/1.94 Preprocessing : 0.70
% 3.34/1.94 Parsing : 0.33
% 3.34/1.95 CNF conversion : 0.03
% 3.34/1.95 Main loop : 0.04
% 3.34/1.95 Inferencing : 0.00
% 3.34/1.95 Reduction : 0.02
% 3.34/1.95 Demodulation : 0.02
% 3.34/1.95 BG Simplification : 0.04
% 3.34/1.95 Subsumption : 0.01
% 3.34/1.95 Abstraction : 0.02
% 3.34/1.95 MUC search : 0.00
% 3.34/1.95 Cooper : 0.00
% 3.34/1.95 Total : 0.79
% 3.34/1.95 Index Insertion : 0.00
% 3.34/1.95 Index Deletion : 0.00
% 3.34/1.95 Index Matching : 0.00
% 3.34/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------