TSTP Solution File: ARI596_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI596_1 : TPTP v8.1.2. Released v5.1.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 : n019.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:04 EDT 2023
% Result : Theorem 2.95s 1.82s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 14 unt; 2 typ; 0 def)
% Number of atoms : 18 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 9 ~; 0 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 44 ( 0 atm; 19 fun; 19 num; 6 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 1 usr; 3 con; 0-2 aty)
% Number of variables : 6 (; 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_36,negated_conjecture,
~ ( ( p(a)
& p($sum(a,1))
& p($difference(a,1)) )
=> ? [Xa: $int] : p($product(3,Xa)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_in_a_aplus1_aminus1_div_3) ).
tff(c_4,plain,
p($difference(a,1)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_52,plain,
p($sum($uminus(1),a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_26,plain,
! [X_1a: $int] : ~ p($product(3,X_1a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_57,plain,
! [X_1a: $int] : ( $product(3,X_1a) != $sum($uminus(1),a) ),
inference(resolution,[status(thm)],[c_52,c_26]) ).
tff(c_59,plain,
~ $divides(3,$sum($uminus(1),a)),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_57]) ).
tff(c_7,plain,
p($sum(a,1)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_44,plain,
p($sum(1,a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_49,plain,
! [X_1a: $int] : ( $product(3,X_1a) != $sum(1,a) ),
inference(resolution,[status(thm)],[c_44,c_26]) ).
tff(c_51,plain,
~ $divides(3,$sum(1,a)),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_49]) ).
tff(c_14,plain,
p(a),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_36,plain,
! [X_12a: $int] : ~ p($product(3,X_12a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_41,plain,
! [X_12a: $int] : ( a != $product(3,X_12a) ),
inference(resolution,[status(thm)],[c_14,c_36]) ).
tff(c_43,plain,
~ $divides(3,a),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_41]) ).
tff(c_60,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_59,c_51,c_43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ARI596_1 : TPTP v8.1.2. Released v5.1.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.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 4 00:13:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.95/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.95/1.82
% 2.95/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.00/1.85
% 3.00/1.85 Inference rules
% 3.00/1.85 ----------------------
% 3.00/1.85 #Ref : 0
% 3.00/1.85 #Sup : 3
% 3.00/1.85 #Fact : 0
% 3.00/1.85 #Define : 0
% 3.00/1.85 #Split : 0
% 3.00/1.85 #Chain : 0
% 3.00/1.85 #Close : 1
% 3.00/1.85
% 3.00/1.85 Ordering : LPO
% 3.00/1.85
% 3.00/1.85 Simplification rules
% 3.00/1.85 ----------------------
% 3.00/1.85 #Subsume : 0
% 3.00/1.85 #Demod : 0
% 3.00/1.85 #Tautology : 0
% 3.00/1.85 #SimpNegUnit : 0
% 3.00/1.85 #BackRed : 0
% 3.00/1.85
% 3.00/1.85 #Partial instantiations: 0
% 3.00/1.85 #Strategies tried : 1
% 3.00/1.85
% 3.00/1.85 Timing (in seconds)
% 3.00/1.85 ----------------------
% 3.00/1.85 Preprocessing : 0.45
% 3.00/1.85 Parsing : 0.26
% 3.00/1.85 CNF conversion : 0.02
% 3.00/1.85 Main loop : 0.18
% 3.00/1.85 Inferencing : 0.04
% 3.00/1.85 Reduction : 0.03
% 3.00/1.85 Demodulation : 0.02
% 3.00/1.86 BG Simplification : 0.02
% 3.00/1.86 Subsumption : 0.03
% 3.00/1.86 Abstraction : 0.01
% 3.00/1.86 MUC search : 0.00
% 3.00/1.86 Cooper : 0.04
% 3.00/1.86 Total : 0.68
% 3.00/1.86 Index Insertion : 0.00
% 3.00/1.86 Index Deletion : 0.00
% 3.00/1.86 Index Matching : 0.00
% 3.00/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------