%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI611_1 : TPTP v9.0.0. 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 : n010.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 : Wed Apr 9 05:40:41 PM UTC 2025
% Result : Theorem 2.77s 1.75s
% Output : CNFRefutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 31 ( 14 ~; 10 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 36 ( 14 atm; 0 fun; 14 num; 8 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 0 usr; 4 con; 0-0 aty)
% Number of variables : 8 ( 7 !; 1 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: $int > $o ).
tff(p,type,
p: $int > $o ).
tff(f_46,negated_conjecture,
~ ( ( ! [Xa: $int] :
( ( $less(5,Xa)
& $less(Xa,15) )
<=> p(Xa) )
& ! [Xa: $int] :
( ( $less(8,Xa)
& $less(Xa,18) )
<=> q(Xa) ) )
=> ? [Xa: $int] :
( p(Xa)
& q(Xa) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_5_15_and_8_18_intersect) ).
tff(c_11,plain,
! [X_1a: $int] :
( p(X_1a)
| ~ $less(5,X_1a)
| ~ $less(X_1a,15) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_21,plain,
! [X_9a: $int] :
( q(X_9a)
| ~ $less(8,X_9a)
| ~ $less(X_9a,18) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_15,plain,
! [X_3a: $int] :
( ~ q(X_3a)
| ~ p(X_3a) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_48,plain,
! [X_11a: $int] :
( ~ p(X_11a)
| ~ $less(8,X_11a)
| ~ $less(X_11a,18) ),
inference(resolution,[status(thm)],[c_21,c_15]) ).
tff(c_53,plain,
! [X_1a: $int] :
( ~ $less(8,X_1a)
| ~ $less(X_1a,18)
| ~ $less(5,X_1a)
| ~ $less(X_1a,15) ),
inference(resolution,[status(thm)],[c_11,c_48]) ).
tff(c_55,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ARI611_1 : TPTP v9.0.0. Released v5.1.0.
% 0.12/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 : n010.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 : Mon Apr 7 15:14:47 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.77/1.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.77/1.75
% 2.77/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------