TSTP Solution File: ARI647_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI647_1 : TPTP v8.1.2. Released v6.3.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 : n001.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:11 EDT 2023
% Result : Theorem 2.15s 1.57s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 6 unt; 1 typ; 0 def)
% Number of atoms : 8 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 5 ~; 1 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 28 ( 4 atm; 10 fun; 14 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 1 usr; 5 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_35,negated_conjecture,
~ ( ~ $lesseq($uminus(1),$product($uminus(1),$product(2,a)))
| ( $product(3,a) != 3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(c_1,plain,
$product(3,a) = 3,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_6,plain,
a = 1,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_3,plain,
$lesseq($uminus(1),$product($uminus(1),$product(2,a))),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_5,plain,
~ $less(0,a),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_7,plain,
~ $less(0,1),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_5]) ).
tff(c_9,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI647_1 : TPTP v8.1.2. Released v6.3.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 : n001.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 : Fri Aug 4 00:45:26 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.15/1.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.15/1.57
% 2.15/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.59/1.61
% 2.59/1.61 Inference rules
% 2.59/1.61 ----------------------
% 2.59/1.61 #Ref : 0
% 2.59/1.61 #Sup : 0
% 2.59/1.61 #Fact : 0
% 2.59/1.61 #Define : 0
% 2.59/1.61 #Split : 0
% 2.59/1.61 #Chain : 0
% 2.59/1.61 #Close : 0
% 2.59/1.61
% 2.59/1.61 Ordering : LPO
% 2.59/1.61
% 2.59/1.61 Simplification rules
% 2.59/1.61 ----------------------
% 2.59/1.61 #Subsume : 1
% 2.59/1.61 #Demod : 1
% 2.59/1.61 #Tautology : 0
% 2.59/1.61 #SimpNegUnit : 0
% 2.59/1.61 #BackRed : 0
% 2.59/1.61
% 2.59/1.61 #Partial instantiations: 0
% 2.59/1.61 #Strategies tried : 1
% 2.59/1.61
% 2.59/1.61 Timing (in seconds)
% 2.59/1.61 ----------------------
% 2.59/1.62 Preprocessing : 0.44
% 2.59/1.62 Parsing : 0.25
% 2.59/1.62 CNF conversion : 0.02
% 2.59/1.62 Main loop : 0.05
% 2.59/1.62 Inferencing : 0.00
% 2.59/1.62 Reduction : 0.02
% 2.59/1.62 Demodulation : 0.01
% 2.59/1.62 BG Simplification : 0.02
% 2.59/1.62 Subsumption : 0.02
% 2.59/1.62 Abstraction : 0.00
% 2.59/1.62 MUC search : 0.00
% 2.59/1.62 Cooper : 0.00
% 2.59/1.62 Total : 0.55
% 2.59/1.62 Index Insertion : 0.00
% 2.59/1.62 Index Deletion : 0.00
% 2.59/1.62 Index Matching : 0.00
% 2.59/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------