TSTP Solution File: ARI081_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI081_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 : n032.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:33:10 EDT 2023
% Result : Theorem 1.90s 1.27s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 10 ( 3 ~; 0 |; 5 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 26 ( 0 atm; 6 fun; 12 num; 8 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 8 (; 4 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_34,negated_conjecture,
~ ! [Z1a: $int,Z2a: $int] :
( ( ( $sum(6,7) = Z1a )
& ( $sum(7,6) = Z2a ) )
=> ( Z1a = Z2a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',communative_sum_6_7) ).
tff(f_143,plain,
? [Z1a: $int,Z2a: $int] :
( ( $sum(6,7) = Z1a )
& ( $sum(7,6) = Z2a )
& ( Z1a != Z2a ) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(f_146,plain,
! [Z1a: $int,Z2a: $int] :
( ? [Z1a: $int,Z2a: $int] :
( ( $sum(6,7) = Z1a )
& ( $sum(7,6) = Z2a )
& ( Z1a != Z2a ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_147,plain,
$false,
inference(equivalence,[status(thm)],[f_143,f_146]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : ARI081_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.10 % 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.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri Aug 4 00:13:21 EDT 2023
% 0.09/0.29 % CPUTime :
% 1.90/1.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.90/1.27
% 1.90/1.27 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.96/1.31
% 1.96/1.31 Inference rules
% 1.96/1.31 ----------------------
% 1.96/1.31 #Ref : 0
% 1.96/1.31 #Sup : 0
% 1.96/1.31 #Fact : 0
% 1.96/1.31 #Define : 0
% 1.96/1.31 #Split : 0
% 1.96/1.31 #Chain : 0
% 1.96/1.31 #Close : 0
% 1.96/1.31
% 1.96/1.31 Ordering : LPO
% 1.96/1.31
% 1.96/1.31 Simplification rules
% 1.96/1.31 ----------------------
% 1.96/1.31 #Subsume : 0
% 1.96/1.31 #Demod : 0
% 1.96/1.31 #Tautology : 0
% 1.96/1.31 #SimpNegUnit : 0
% 1.96/1.31 #BackRed : 0
% 1.96/1.31
% 1.96/1.31 #Partial instantiations: 0
% 1.96/1.31 #Strategies tried : 1
% 1.96/1.31
% 1.96/1.31 Timing (in seconds)
% 1.96/1.31 ----------------------
% 1.96/1.31 Preprocessing : 0.41
% 1.96/1.31 Parsing : 0.24
% 1.96/1.31 CNF conversion : 0.01
% 1.96/1.31 Main loop : 0.02
% 1.96/1.31 Inferencing : 0.00
% 1.96/1.31 Reduction : 0.00
% 1.96/1.31 Demodulation : 0.00
% 1.96/1.31 BG Simplification : 0.00
% 1.96/1.31 Subsumption : 0.02
% 1.96/1.31 Abstraction : 0.00
% 1.96/1.31 MUC search : 0.00
% 1.96/1.31 Cooper : 0.03
% 1.96/1.31 Total : 0.48
% 1.96/1.31 Index Insertion : 0.00
% 1.96/1.31 Index Deletion : 0.00
% 1.96/1.31 Index Matching : 0.00
% 1.96/1.31 BG Taut test : 0.00
%------------------------------------------------------------------------------