TSTP Solution File: ARI178_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI178_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 : n014.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:19 EDT 2023
% Result : Theorem 2.20s 1.52s
% Output : CNFRefutation 2.20s
% 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 : 9 ( 2 ~; 0 |; 5 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 45 ( 0 atm; 18 fun; 15 num; 12 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 : 5 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 12 (; 6 !; 6 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_36,negated_conjecture,
~ ! [Ua: $int,Va: $int,Wa: $int] :
( ( ( $sum($sum($product(2,Ua),Va),Wa) = 10 )
& ( $sum($sum(Ua,$product(2,Va)),Wa) = 10 ) )
=> ( Wa != 0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_167,plain,
? [Ua: $int,Va: $int,Wa: $int] :
( ( $sum($sum(Va,$product(2,Ua)),Wa) = 10 )
& ( $sum($sum($product(2,Va),Ua),Wa) = 10 )
& ( Wa = 0 ) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(f_170,plain,
! [Ua: $int,Va: $int,Wa: $int] :
( ? [Ua: $int,Va: $int,Wa: $int] :
( ( $sum($sum(Va,$product(2,Ua)),Wa) = 10 )
& ( $sum($sum($product(2,Va),Ua),Wa) = 10 )
& ( Wa = 0 ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_171,plain,
$false,
inference(equivalence,[status(thm)],[f_167,f_170]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI178_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 4 00:07:03 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.20/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.20/1.53
% 2.20/1.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.20/1.57
% 2.20/1.57 Inference rules
% 2.20/1.57 ----------------------
% 2.20/1.57 #Ref : 0
% 2.20/1.57 #Sup : 0
% 2.20/1.57 #Fact : 0
% 2.20/1.57 #Define : 0
% 2.20/1.57 #Split : 0
% 2.20/1.57 #Chain : 0
% 2.20/1.57 #Close : 0
% 2.20/1.57
% 2.20/1.57 Ordering : LPO
% 2.20/1.57
% 2.20/1.57 Simplification rules
% 2.20/1.57 ----------------------
% 2.20/1.57 #Subsume : 0
% 2.20/1.57 #Demod : 0
% 2.20/1.57 #Tautology : 0
% 2.20/1.57 #SimpNegUnit : 0
% 2.20/1.57 #BackRed : 0
% 2.20/1.57
% 2.20/1.57 #Partial instantiations: 0
% 2.20/1.57 #Strategies tried : 1
% 2.20/1.57
% 2.20/1.57 Timing (in seconds)
% 2.20/1.57 ----------------------
% 2.20/1.57 Preprocessing : 0.47
% 2.20/1.57 Parsing : 0.26
% 2.20/1.57 CNF conversion : 0.02
% 2.20/1.57 Main loop : 0.03
% 2.20/1.57 Inferencing : 0.00
% 2.20/1.57 Reduction : 0.00
% 2.20/1.57 Demodulation : 0.00
% 2.20/1.57 BG Simplification : 0.00
% 2.20/1.57 Subsumption : 0.02
% 2.20/1.57 Abstraction : 0.00
% 2.20/1.57 MUC search : 0.00
% 2.20/1.57 Cooper : 0.04
% 2.20/1.57 Total : 0.55
% 2.20/1.57 Index Insertion : 0.00
% 2.20/1.57 Index Deletion : 0.00
% 2.20/1.57 Index Matching : 0.00
% 2.20/1.57 BG Taut test : 0.00
%------------------------------------------------------------------------------