TSTP Solution File: ARI654_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI654_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 : Unsatisfiable 2.26s 1.63s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 13 unt; 3 typ; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 54 ( 12 atm; 21 fun; 21 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 : 9 ( 3 usr; 6 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(y,type,
y: $int ).
tff(z,type,
z: $int ).
tff(x,type,
x: $int ).
%Foreground operators:
tff(f_32,axiom,
$lesseq($product(5,z),$difference(y,1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_002) ).
tff(f_33,axiom,
$greatereq($product(5,z),$difference(y,2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_003) ).
tff(f_30,axiom,
$greatereq(y,$difference($product(5,x),1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_31,axiom,
$lesseq(y,$product(5,x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_001) ).
tff(c_5,plain,
$lesseq($product(5,z),$difference(y,1)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_10,plain,
~ $less(y,$sum(1,$product(5,z))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_7,plain,
$greatereq($product(5,z),$difference(y,2)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_9,plain,
~ $less($sum(2,$product(5,z)),y),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_1,plain,
$greatereq(y,$difference($product(5,x),1)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_12,plain,
~ $less($sum(1,y),$product(5,x)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_3,plain,
$lesseq(y,$product(5,x)),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_11,plain,
~ $less($product(5,x),y),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_13,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_10,c_9,c_12,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ARI654_1 : TPTP v8.1.2. Released v6.3.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.19/0.37 % Computer : n001.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Fri Aug 4 00:43:11 EDT 2023
% 0.19/0.37 % CPUTime :
% 2.26/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.26/1.63
% 2.26/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.26/1.66
% 2.26/1.66 Inference rules
% 2.26/1.66 ----------------------
% 2.26/1.66 #Ref : 0
% 2.26/1.66 #Sup : 0
% 2.26/1.66 #Fact : 0
% 2.26/1.66 #Define : 0
% 2.26/1.66 #Split : 0
% 2.26/1.66 #Chain : 0
% 2.26/1.66 #Close : 1
% 2.26/1.66
% 2.26/1.66 Ordering : LPO
% 2.26/1.66
% 2.26/1.66 Simplification rules
% 2.26/1.66 ----------------------
% 2.26/1.66 #Subsume : 0
% 2.26/1.66 #Demod : 0
% 2.26/1.66 #Tautology : 0
% 2.26/1.66 #SimpNegUnit : 0
% 2.26/1.66 #BackRed : 0
% 2.26/1.66
% 2.26/1.66 #Partial instantiations: 0
% 2.26/1.66 #Strategies tried : 1
% 2.26/1.66
% 2.26/1.66 Timing (in seconds)
% 2.26/1.66 ----------------------
% 2.26/1.67 Preprocessing : 0.42
% 2.26/1.67 Parsing : 0.24
% 2.26/1.67 CNF conversion : 0.02
% 2.26/1.67 Main loop : 0.13
% 2.26/1.67 Inferencing : 0.00
% 2.26/1.67 Reduction : 0.01
% 2.26/1.67 Demodulation : 0.01
% 2.26/1.67 BG Simplification : 0.02
% 2.26/1.67 Subsumption : 0.03
% 2.26/1.67 Abstraction : 0.00
% 2.26/1.67 MUC search : 0.01
% 2.26/1.67 Cooper : 0.07
% 2.26/1.67 Total : 0.61
% 2.26/1.67 Index Insertion : 0.00
% 2.26/1.67 Index Deletion : 0.00
% 2.26/1.67 Index Matching : 0.00
% 2.26/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------