%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT106_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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n026.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:08 PM UTC 2025
% Result : Theorem 226.69s 203.02s
% Output : CNFRefutation 226.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 28 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 86 ( 41 ~; 38 |; 5 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 110 ( 21 atm; 25 fun; 33 num; 31 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 46 !; 2 ?; 48 :)
% 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/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(f_31,axiom,
! [Ka: $int,L: list] : ( head(cons(Ka,L)) = Ka ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1) ).
tff(f_41,axiom,
! [Ka: $int,L: list] : ( cons(Ka,L) != nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4) ).
tff(f_65,negated_conjecture,
~ ~ ! [Na: $int,L0: list,L1: list] :
( ( $greater(Na,0)
& inRange(Na,L0)
& ( L1 = cons($difference(Na,2),L0) ) )
=> inRange(Na,L1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(c_253581,plain,
! [N_48099: $int] : inRange(N_48099,nil),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_253590,plain,
! [K_48116: $int,L_48117: list] : ( head(cons(K_48116,L_48117)) = K_48116 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_253587,plain,
! [K_48111: $int,L_48112: list] : ( cons(K_48111,L_48112) != nil ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_24,plain,
! [N_16a: $int,L0_17: list] :
( inRange(N_16a,cons($sum($uminus(2),N_16a),L0_17))
| ~ inRange(N_16a,L0_17)
| ~ $greater(N_16a,0) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_253683,plain,
! [N_48134: $int,X_48135: $int,L0_48136: list] :
( inRange(N_48134,cons(X_48135,L0_48136))
| ( X_48135 != $sum($uminus(2),N_48134) )
| ~ inRange(N_48134,L0_48136)
| ~ $less(0,N_48134) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_24]) ).
tff(c_253583,plain,
! [N_48103: $int,L_48104: list] :
( ( cons('#skF_1'(N_48103,L_48104),'#skF_2'(N_48103,L_48104)) = L_48104 )
| ( nil = L_48104 )
| ~ inRange(N_48103,L_48104) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_253686,plain,
! [N_48134: $int,X_48135: $int,L0_48136: list] :
( ( cons('#skF_1'(N_48134,cons(X_48135,L0_48136)),'#skF_2'(N_48134,cons(X_48135,L0_48136))) = cons(X_48135,L0_48136) )
| ( cons(X_48135,L0_48136) = nil )
| ( X_48135 != $sum($uminus(2),N_48134) )
| ~ inRange(N_48134,L0_48136)
| ~ $less(0,N_48134) ),
inference(resolution,[status(thm)],[c_253683,c_253583]) ).
tff(c_254230,plain,
! [N_48199: $int,X_48200: $int,L0_48201: list] :
( ( cons('#skF_1'(N_48199,cons(X_48200,L0_48201)),'#skF_2'(N_48199,cons(X_48200,L0_48201))) = cons(X_48200,L0_48201) )
| ( X_48200 != $sum($uminus(2),N_48199) )
| ~ inRange(N_48199,L0_48201)
| ~ $less(0,N_48199) ),
inference(negUnitSimplification,[status(thm)],[c_253587,c_253686]) ).
tff(c_254248,plain,
! [N_48202: $int,X_48203: $int] :
( ( cons('#skF_1'(N_48202,cons(X_48203,nil)),'#skF_2'(N_48202,cons(X_48203,nil))) = cons(X_48203,nil) )
| ( X_48203 != $sum($uminus(2),N_48202) )
| ~ $less(0,N_48202) ),
inference(resolution,[status(thm)],[c_253581,c_254230]) ).
tff(c_254270,plain,
! [X_48203: $int,N_48202: $int] :
( ( head(cons(X_48203,nil)) = '#skF_1'(N_48202,cons(X_48203,nil)) )
| ( X_48203 != $sum($uminus(2),N_48202) )
| ~ $less(0,N_48202) ),
inference(superposition,[status(thm),theory(equality)],[c_254248,c_253590]) ).
tff(c_254352,plain,
! [N_48206: $int,X_48207: $int] :
( ( '#skF_1'(N_48206,cons(X_48207,nil)) = X_48207 )
| ( X_48207 != $sum($uminus(2),N_48206) )
| ~ $less(0,N_48206) ),
inference(demodulation,[status(thm),theory(equality)],[c_253590,c_254270]) ).
tff(c_14,plain,
! [N_8a: $int,L_9: list] :
( $lesseq(0,'#skF_1'(N_8a,L_9))
| ( nil = L_9 )
| ~ inRange(N_8a,L_9) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_253584,plain,
! [N_48105: $int,L_48106: list] :
( ~ $less('#skF_1'(N_48105,L_48106),0)
| ( nil = L_48106 )
| ~ inRange(N_48105,L_48106) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_14]) ).
tff(c_253689,plain,
! [N_48134: $int,X_48135: $int,L0_48136: list] :
( ~ $less('#skF_1'(N_48134,cons(X_48135,L0_48136)),0)
| ( cons(X_48135,L0_48136) = nil )
| ( X_48135 != $sum($uminus(2),N_48134) )
| ~ inRange(N_48134,L0_48136)
| ~ $less(0,N_48134) ),
inference(resolution,[status(thm)],[c_253683,c_253584]) ).
tff(c_253703,plain,
! [N_48134: $int,X_48135: $int,L0_48136: list] :
( ~ $less('#skF_1'(N_48134,cons(X_48135,L0_48136)),0)
| ( X_48135 != $sum($uminus(2),N_48134) )
| ~ inRange(N_48134,L0_48136)
| ~ $less(0,N_48134) ),
inference(negUnitSimplification,[status(thm)],[c_253587,c_253689]) ).
tff(c_254371,plain,
! [X_48207: $int,N_48206: $int] :
( ~ $less(X_48207,0)
| ( X_48207 != $sum($uminus(2),N_48206) )
| ~ inRange(N_48206,nil)
| ~ $less(0,N_48206)
| ( X_48207 != $sum($uminus(2),N_48206) )
| ~ $less(0,N_48206) ),
inference(superposition,[status(thm),theory(equality)],[c_254352,c_253703]) ).
tff(c_254428,plain,
! [N_48206: $int] :
( ~ $less($sum($uminus(2),N_48206),0)
| ~ $less(0,N_48206) ),
inference(demodulation,[status(thm),theory(equality)],[c_253581,c_254371]) ).
tff(c_254430,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_254428]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : DAT106_1 : TPTP v9.0.0. Released v6.1.0.
% 0.03/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.31 % Computer : n026.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon Apr 7 18:17:53 EDT 2025
% 0.12/0.31 % CPUTime :
% 122.81/104.83 ***********************************************************************
% 122.81/104.83 After 103.3 sec it's time to try something different, got 98.1 sec left
% 122.81/104.83 ***********************************************************************
% 226.40/202.92 ***********************************************************************
% 226.40/202.92 After 201.4 sec it's time to try something different, got 98.1 sec left
% 226.40/202.92 ***********************************************************************
% 226.69/203.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 226.69/203.03
% 226.69/203.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------