%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT098_1 : TPTP v9.0.0. Released v6.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 : n015.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 06:08:06 PM UTC 2025
% Result : Theorem 3.02s 1.72s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 39 ( 18 ~; 17 |; 3 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 64 ( 16 atm; 0 fun; 39 num; 9 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 14 ( 12 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > cons > #nlpp > tail > head > nil > #skF_1 > #skF_2
%Foreground sorts:
tff(list,type,
list: $tType ).
%Background operators:
%Foreground operators:
tff(inRange,type,
inRange: ( $int * list ) > $o ).
tff(tail,type,
tail: list > list ).
tff(nil,type,
nil: list ).
tff(head,type,
head: list > $int ).
tff(cons,type,
cons: ( $int * list ) > list ).
tff('#skF_1',type,
'#skF_1': ( $int * list ) > $int ).
tff('#skF_2',type,
'#skF_2': ( $int * list ) > list ).
tff(f_55,axiom,
! [Na: $int,L: list] :
( inRange(Na,L)
<=> ( ( L = nil )
| ? [Ka: $int,T: list] :
( ( L = cons(Ka,T) )
& $lesseq(0,Ka)
& $less(Ka,Na)
& inRange(Na,T) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).
tff(f_57,negated_conjecture,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(c_26,plain,
! [N_8a: $int] : inRange(N_8a,nil),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_19,plain,
! [N_8a: $int,T_15: list,K_14a: $int] :
( ~ inRange(N_8a,T_15)
| inRange(N_8a,cons(K_14a,T_15))
| ~ $lesseq(0,K_14a)
| ~ $less(K_14a,N_8a) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_27,plain,
! [N_8a: $int,T_15: list,K_14a: $int] :
( ~ inRange(N_8a,T_15)
| inRange(N_8a,cons(K_14a,T_15))
| $less(K_14a,0)
| ~ $less(K_14a,N_8a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_19]) ).
tff(c_115,plain,
! [N_32a: $int,T_33: list,K_34a: $int] :
( ~ inRange(N_32a,T_33)
| inRange(N_32a,cons(K_34a,T_33))
| $less(K_34a,0)
| ~ $less(K_34a,N_32a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_19]) ).
tff(c_25,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_140,plain,
( ~ inRange(4,cons(3,cons(2,nil)))
| $less(1,0)
| ~ $less(1,4) ),
inference(resolution,[status(thm)],[c_115,c_25]) ).
tff(c_142,plain,
~ inRange(4,cons(3,cons(2,nil))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_140]) ).
tff(c_146,plain,
( ~ inRange(4,cons(2,nil))
| $less(3,0)
| ~ $less(3,4) ),
inference(resolution,[status(thm)],[c_27,c_142]) ).
tff(c_148,plain,
~ inRange(4,cons(2,nil)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_146]) ).
tff(c_151,plain,
( ~ inRange(4,nil)
| $less(2,0)
| ~ $less(2,4) ),
inference(resolution,[status(thm)],[c_27,c_148]) ).
tff(c_154,plain,
( $less(2,0)
| ~ $less(2,4) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_151]) ).
tff(c_157,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_154]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT098_1 : TPTP v9.0.0. Released v6.1.0.
% 0.03/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.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Apr 7 18:18:05 EDT 2025
% 0.14/0.34 % CPUTime :
% 3.02/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.02/1.72
% 3.02/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------