TSTP Solution File: ARI083_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI083_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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n005.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 2.34s 1.73s
% Output : CNFRefutation 2.34s
% 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 : 18 ( 15 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 16 ( 3 ~; 0 |; 11 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 40 ( 0 atm; 12 fun; 0 num; 28 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 : 1 ( 0 usr; 0 con; 2-2 aty)
% Number of variables : 28 (; 21 !; 7 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_38,negated_conjecture,
~ ? [Xa: $int,Ya: $int,Za: $int,Z1a: $int,Z2a: $int,Z3a: $int,Z4a: $int] :
( ( ( $sum(Xa,Ya) = Z1a )
& ( $sum(Z1a,Za) = Z2a )
& ( $sum(Ya,Za) = Z3a )
& ( $sum(Xa,Z3a) = Z4a ) )
=> ( Z2a = Z4a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associative_sum_exists) ).
tff(f_230,plain,
! [Xa: $int,Ya: $int,Za: $int,Z1a: $int,Z2a: $int,Z3a: $int,Z4a: $int] :
( ( $sum(Xa,Ya) = Z1a )
& ( $sum(Z1a,Za) = Z2a )
& ( $sum(Ya,Za) = Z3a )
& ( $sum(Xa,Z3a) = Z4a )
& ( Z2a != Z4a ) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(f_233,plain,
! [Ya: $int,Z3a: $int,Z4a: $int,Z2a: $int,Z1a: $int,Za: $int,Xa: $int] :
( ! [Xa: $int,Ya: $int,Za: $int,Z1a: $int,Z2a: $int,Z3a: $int,Z4a: $int] :
( ( $sum(Xa,Ya) = Z1a )
& ( $sum(Z1a,Za) = Z2a )
& ( $sum(Ya,Za) = Z3a )
& ( $sum(Xa,Z3a) = Z4a )
& ( Z2a != Z4a ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_234,plain,
$false,
inference(equivalence,[status(thm)],[f_230,f_233]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : ARI083_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.09 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.29 % Computer : n005.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:08:56 EDT 2023
% 0.09/0.29 % CPUTime :
% 2.34/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.34/1.74
% 2.34/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.34/1.77
% 2.34/1.77 Inference rules
% 2.34/1.77 ----------------------
% 2.34/1.77 #Ref : 0
% 2.34/1.77 #Sup : 0
% 2.34/1.77 #Fact : 0
% 2.34/1.77 #Define : 0
% 2.34/1.77 #Split : 0
% 2.34/1.77 #Chain : 0
% 2.34/1.77 #Close : 0
% 2.34/1.77
% 2.34/1.77 Ordering : LPO
% 2.34/1.77
% 2.34/1.77 Simplification rules
% 2.34/1.77 ----------------------
% 2.34/1.77 #Subsume : 0
% 2.34/1.77 #Demod : 0
% 2.34/1.77 #Tautology : 0
% 2.34/1.77 #SimpNegUnit : 0
% 2.34/1.77 #BackRed : 0
% 2.34/1.77
% 2.34/1.77 #Partial instantiations: 0
% 2.34/1.77 #Strategies tried : 1
% 2.34/1.77
% 2.34/1.77 Timing (in seconds)
% 2.34/1.77 ----------------------
% 2.51/1.77 Preprocessing : 0.61
% 2.51/1.78 Parsing : 0.36
% 2.51/1.78 CNF conversion : 0.02
% 2.51/1.78 Main loop : 0.02
% 2.51/1.78 Inferencing : 0.00
% 2.51/1.78 Reduction : 0.00
% 2.51/1.78 Demodulation : 0.00
% 2.51/1.78 BG Simplification : 0.00
% 2.51/1.78 Subsumption : 0.02
% 2.51/1.78 Abstraction : 0.00
% 2.51/1.78 MUC search : 0.00
% 2.51/1.78 Cooper : 0.04
% 2.51/1.78 Total : 0.69
% 2.51/1.78 Index Insertion : 0.00
% 2.51/1.78 Index Deletion : 0.00
% 2.51/1.78 Index Matching : 0.00
% 2.51/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------