TSTP Solution File: ARI597_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI597_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 : n025.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:05 EDT 2023
% Result : Theorem 2.77s 1.70s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 13 unt; 3 typ; 0 def)
% Number of atoms : 17 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 10 ~; 0 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 29 ( 0 atm; 13 fun; 10 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 : 6 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 6 (; 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_36,negated_conjecture,
~ ( ( p(a)
& p(b)
& p($sum(a,b)) )
=> ? [Xa: $int] : p($product(2,Xa)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_or_b_or_aplusb_even) ).
tff(c_20,plain,
p($sum(a,b)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_36,plain,
! [X_14a: $int] : ~ p($product(2,X_14a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_46,plain,
! [X_14a: $int] : ( $sum(a,b) != $product(2,X_14a) ),
inference(resolution,[status(thm)],[c_20,c_36]) ).
tff(c_48,plain,
! [X_14a: $int] : ( b != $sum($uminus(a),$product(2,X_14a)) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_46]) ).
tff(c_57,plain,
~ $divides(2,$sum(a,b)),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_48]) ).
tff(c_59,plain,
~ $divides(2,$sum(b,a)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_57]) ).
tff(c_12,plain,
p(a),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_52,plain,
! [X_14a: $int] : ( a != $product(2,X_14a) ),
inference(resolution,[status(thm)],[c_12,c_36]) ).
tff(c_56,plain,
~ $divides(2,a),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_52]) ).
tff(c_16,plain,
p(b),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_50,plain,
! [X_14a: $int] : ( b != $product(2,X_14a) ),
inference(resolution,[status(thm)],[c_16,c_36]) ).
tff(c_54,plain,
~ $divides(2,b),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_50]) ).
tff(c_60,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_59,c_56,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI597_1 : TPTP v8.1.2. Released v5.1.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.15/0.36 % Computer : n025.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:24:20 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.77/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.77/1.70
% 2.77/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.97/1.74
% 2.97/1.74 Inference rules
% 2.97/1.74 ----------------------
% 2.97/1.74 #Ref : 0
% 2.97/1.74 #Sup : 3
% 2.97/1.74 #Fact : 0
% 2.97/1.74 #Define : 0
% 2.97/1.74 #Split : 0
% 2.97/1.74 #Chain : 0
% 2.97/1.74 #Close : 1
% 2.97/1.74
% 2.97/1.74 Ordering : LPO
% 2.97/1.74
% 2.97/1.74 Simplification rules
% 2.97/1.74 ----------------------
% 2.97/1.74 #Subsume : 0
% 2.97/1.74 #Demod : 0
% 2.97/1.74 #Tautology : 0
% 2.97/1.74 #SimpNegUnit : 0
% 2.97/1.74 #BackRed : 0
% 2.97/1.74
% 2.97/1.74 #Partial instantiations: 0
% 2.97/1.74 #Strategies tried : 1
% 2.97/1.74
% 2.97/1.74 Timing (in seconds)
% 2.97/1.74 ----------------------
% 2.97/1.74 Preprocessing : 0.47
% 2.97/1.74 Parsing : 0.25
% 2.97/1.74 CNF conversion : 0.02
% 2.97/1.74 Main loop : 0.18
% 2.97/1.74 Inferencing : 0.04
% 2.97/1.74 Reduction : 0.03
% 2.97/1.74 Demodulation : 0.02
% 2.97/1.74 BG Simplification : 0.02
% 2.97/1.74 Subsumption : 0.03
% 2.97/1.74 Abstraction : 0.01
% 2.97/1.74 MUC search : 0.01
% 2.97/1.74 Cooper : 0.05
% 2.97/1.74 Total : 0.70
% 2.97/1.74 Index Insertion : 0.00
% 2.97/1.74 Index Deletion : 0.00
% 2.97/1.74 Index Matching : 0.00
% 2.97/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------