TSTP Solution File: NUM921_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM921_1 : TPTP v8.1.2. Released v5.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 : n018.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:53:04 EDT 2023
% Result : Theorem 2.35s 1.59s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 14 ( 6 atm; 2 fun; 2 num; 4 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skF_1',type,
'#skF_1': $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_34,negated_conjecture,
~ ( ! [Ua: $int] : $greater(f(Ua),Ua)
=> ! [Va: $int] : $less($difference(Va,f(Va)),0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_5,plain,
! [U_1a: $int] : $greater(f(U_1a),U_1a),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_7,plain,
! [U_1a: $int] : $less(U_1a,f(U_1a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_2,plain,
~ $less($difference('#skF_1',f('#skF_1')),0),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_11,plain,
~ $less('#skF_1',f('#skF_1')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_14,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_7,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM921_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.15 % 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.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 15:28:35 EDT 2023
% 0.16/0.37 % CPUTime :
% 2.35/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.35/1.60
% 2.35/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.50/1.63
% 2.50/1.63 Inference rules
% 2.50/1.63 ----------------------
% 2.50/1.63 #Ref : 0
% 2.50/1.63 #Sup : 0
% 2.50/1.63 #Fact : 0
% 2.50/1.63 #Define : 0
% 2.50/1.63 #Split : 0
% 2.50/1.63 #Chain : 0
% 2.50/1.63 #Close : 0
% 2.50/1.63
% 2.50/1.63 Ordering : LPO
% 2.50/1.63
% 2.50/1.63 Simplification rules
% 2.50/1.63 ----------------------
% 2.50/1.63 #Subsume : 1
% 2.50/1.63 #Demod : 1
% 2.50/1.63 #Tautology : 0
% 2.50/1.63 #SimpNegUnit : 0
% 2.50/1.63 #BackRed : 0
% 2.50/1.63
% 2.50/1.63 #Partial instantiations: 0
% 2.50/1.63 #Strategies tried : 1
% 2.50/1.63
% 2.50/1.63 Timing (in seconds)
% 2.50/1.63 ----------------------
% 2.50/1.63 Preprocessing : 0.44
% 2.50/1.63 Parsing : 0.24
% 2.50/1.63 CNF conversion : 0.02
% 2.50/1.63 Main loop : 0.04
% 2.50/1.63 Inferencing : 0.00
% 2.50/1.63 Reduction : 0.02
% 2.50/1.63 Demodulation : 0.02
% 2.50/1.63 BG Simplification : 0.01
% 2.50/1.63 Subsumption : 0.02
% 2.50/1.63 Abstraction : 0.01
% 2.50/1.63 MUC search : 0.00
% 2.50/1.63 Cooper : 0.00
% 2.50/1.63 Total : 0.53
% 2.50/1.64 Index Insertion : 0.00
% 2.50/1.64 Index Deletion : 0.00
% 2.50/1.64 Index Matching : 0.00
% 2.50/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------