TSTP Solution File: ARI574_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI574_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/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 : n002.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:01 EDT 2023
% Result : Theorem 2.36s 1.53s
% Output : CNFRefutation 2.36s
% 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 : 28 ( 10 equ)
% Maximal formula atoms : 11 ( 5 avg)
% Number of connectives : 34 ( 11 ~; 8 |; 13 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 68 ( 15 atm; 15 fun; 30 num; 8 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 0 usr; 5 con; 0-2 aty)
% Number of variables : 8 (; 4 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_38,negated_conjecture,
~ ! [Xa: $int,Ya: $int] :
( ( $lesseq(7,$sum(Xa,Ya))
& $lesseq($sum(Xa,5),$product(2,Ya))
& $lesseq(Ya,4) )
<=> ( ( Xa = 3 )
& ( Ya = 4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ineq_sys_has_1_sol) ).
tff(f_533,plain,
? [Xa: $int,Ya: $int] :
( ( $lesseq(7,$sum(Xa,Ya))
& $lesseq($sum(Xa,5),$product(2,Ya))
& $lesseq(Ya,4)
& ( ( Xa != 3 )
| ( Ya != 4 ) ) )
| ( ( Xa = 3 )
& ( Ya = 4 )
& ( ~ $lesseq(7,$sum(Xa,Ya))
| ~ $lesseq($sum(Xa,5),$product(2,Ya))
| ~ $lesseq(Ya,4) ) ) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(f_536,plain,
! [Xa: $int,Ya: $int] :
( ? [Xa: $int,Ya: $int] :
( ( $lesseq(7,$sum(Xa,Ya))
& $lesseq($sum(Xa,5),$product(2,Ya))
& $lesseq(Ya,4)
& ( ( Xa != 3 )
| ( Ya != 4 ) ) )
| ( ( Xa = 3 )
& ( Ya = 4 )
& ( ~ $lesseq(7,$sum(Xa,Ya))
| ~ $lesseq($sum(Xa,5),$product(2,Ya))
| ~ $lesseq(Ya,4) ) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_537,plain,
$false,
inference(equivalence,[status(thm)],[f_533,f_536]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_537]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI574_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/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.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 00:24:46 EDT 2023
% 0.20/0.35 % CPUTime :
% 2.36/1.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.36/1.53
% 2.36/1.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.36/1.57
% 2.36/1.57 Inference rules
% 2.36/1.57 ----------------------
% 2.36/1.57 #Ref : 0
% 2.36/1.57 #Sup : 0
% 2.36/1.57 #Fact : 0
% 2.36/1.57 #Define : 0
% 2.36/1.57 #Split : 0
% 2.36/1.57 #Chain : 0
% 2.36/1.57 #Close : 0
% 2.36/1.57
% 2.36/1.57 Ordering : LPO
% 2.36/1.57
% 2.36/1.57 Simplification rules
% 2.36/1.57 ----------------------
% 2.36/1.57 #Subsume : 0
% 2.36/1.57 #Demod : 0
% 2.36/1.57 #Tautology : 0
% 2.36/1.57 #SimpNegUnit : 0
% 2.36/1.57 #BackRed : 0
% 2.36/1.57
% 2.36/1.57 #Partial instantiations: 0
% 2.36/1.57 #Strategies tried : 1
% 2.36/1.57
% 2.36/1.57 Timing (in seconds)
% 2.36/1.57 ----------------------
% 2.36/1.58 Preprocessing : 0.47
% 2.36/1.58 Parsing : 0.26
% 2.36/1.58 CNF conversion : 0.02
% 2.36/1.58 Main loop : 0.03
% 2.36/1.58 Inferencing : 0.00
% 2.36/1.58 Reduction : 0.00
% 2.36/1.58 Demodulation : 0.00
% 2.36/1.58 BG Simplification : 0.00
% 2.36/1.58 Subsumption : 0.02
% 2.36/1.58 Abstraction : 0.00
% 2.36/1.58 MUC search : 0.00
% 2.36/1.58 Cooper : 0.06
% 2.36/1.58 Total : 0.56
% 2.36/1.58 Index Insertion : 0.00
% 2.36/1.58 Index Deletion : 0.00
% 2.36/1.58 Index Matching : 0.00
% 2.36/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------