TSTP Solution File: DAT076_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT076_1 : TPTP v8.1.2. 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 : n005.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:37:06 EDT 2023
% Result : Theorem 3.65s 1.89s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of formulae : 31 ( 3 unt; 17 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 28 ( 13 ~; 9 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 42 ( 18 atm; 0 fun; 11 num; 13 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 36 ( 16 >; 20 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 13 usr; 1 con; 0-3 aty)
% Number of variables : 26 (; 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > sorted > distinct > write > rev > read > max > #nlpp > init > #skF_5 > #skF_4 > #skF_8 > #skF_1 > #skF_6 > #skF_3 > #skF_7 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
%Foreground operators:
tff(sorted,type,
sorted: ( array * $int ) > $o ).
tff(rev,type,
rev: ( array * $int ) > array ).
tff('#skF_5',type,
'#skF_5': ( array * $int * $int ) > $int ).
tff(write,type,
write: ( array * $int * $int ) > array ).
tff(init,type,
init: $int > array ).
tff('#skF_4',type,
'#skF_4': ( array * $int ) > $int ).
tff('#skF_8',type,
'#skF_8': ( array * array * $int ) > $int ).
tff('#skF_1',type,
'#skF_1': ( array * array ) > $int ).
tff('#skF_6',type,
'#skF_6': ( array * $int ) > $int ).
tff('#skF_3',type,
'#skF_3': ( array * $int ) > $int ).
tff(max,type,
max: ( array * $int ) > $int ).
tff(inRange,type,
inRange: ( array * $int * $int ) > $o ).
tff('#skF_7',type,
'#skF_7': ( array * $int ) > $int ).
tff(read,type,
read: ( array * $int ) > $int ).
tff(distinct,type,
distinct: ( array * $int ) > $o ).
tff('#skF_2',type,
'#skF_2': ( array * $int * $int ) > $int ).
tff(f_74,axiom,
! [A: array,Na: $int] :
( sorted(A,Na)
<=> ! [Ia: $int,Ja: $int] :
( ( $lesseq(0,Ia)
& $less(Ia,Na)
& $less(Ia,Ja)
& $less(Ja,Na) )
=> $lesseq(read(A,Ia),read(A,Ja)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sorted1) ).
tff(f_125,negated_conjecture,
~ ~ ! [A: array,Na: $int] :
( sorted(A,Na)
=> ~ sorted(rev(A,Na),Na) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c4) ).
tff(c_29,plain,
! [A_19: array,N_20a: $int] :
( $lesseq(0,'#skF_3'(A_19,N_20a))
| sorted(A_19,N_20a) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_89,plain,
! [A_19: array,N_20a: $int] :
( ~ $less('#skF_3'(A_19,N_20a),0)
| sorted(A_19,N_20a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_29]) ).
tff(c_90,plain,
! [A_19: array,N_20a: $int] :
( $less('#skF_3'(A_19,N_20a),N_20a)
| sorted(A_19,N_20a) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_129,plain,
! [A_62: array,N_63a: $int] :
( ~ sorted(rev(A_62,N_63a),N_63a)
| ~ sorted(A_62,N_63a) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_143,plain,
! [A_66: array,N_67a: $int] :
( ~ sorted(A_66,N_67a)
| $less('#skF_3'(rev(A_66,N_67a),N_67a),N_67a) ),
inference(resolution,[status(thm)],[c_90,c_129]) ).
tff(c_277,plain,
! [A_104: array,N_105a: $int] :
( $less('#skF_3'(rev(A_104,N_105a),N_105a),N_105a)
| ~ $less('#skF_3'(A_104,N_105a),0) ),
inference(resolution,[status(thm)],[c_89,c_143]) ).
tff(c_203,plain,
! [A_84: array,N_85a: $int] :
( ~ sorted(A_84,N_85a)
| ~ $less('#skF_3'(rev(A_84,N_85a),N_85a),0) ),
inference(resolution,[status(thm)],[c_89,c_129]) ).
tff(c_223,plain,
! [A_19: array,N_20a: $int] :
( ~ $less('#skF_3'(rev(A_19,N_20a),N_20a),0)
| ~ $less('#skF_3'(A_19,N_20a),0) ),
inference(resolution,[status(thm)],[c_89,c_203]) ).
tff(c_295,plain,
! [A_104: array] : ~ $less('#skF_3'(A_104,0),0),
inference(resolution,[status(thm)],[c_277,c_223]) ).
tff(c_332,plain,
! [A_112: array,N_113a: $int] :
( $less('#skF_3'(rev(A_112,N_113a),N_113a),N_113a)
| $less('#skF_3'(A_112,N_113a),N_113a) ),
inference(resolution,[status(thm)],[c_90,c_143]) ).
tff(c_336,plain,
! [A_112: array] : $less('#skF_3'(A_112,0),0),
inference(resolution,[status(thm)],[c_332,c_295]) ).
tff(c_352,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_295,c_336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT076_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:08:42 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.65/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.65/1.89
% 3.65/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.71/1.91
% 3.71/1.91 Inference rules
% 3.71/1.91 ----------------------
% 3.71/1.91 #Ref : 1
% 3.71/1.91 #Sup : 40
% 3.71/1.91 #Fact : 0
% 3.71/1.91 #Define : 0
% 3.71/1.91 #Split : 0
% 3.71/1.91 #Chain : 0
% 3.71/1.91 #Close : 0
% 3.71/1.91
% 3.71/1.91 Ordering : LPO
% 3.71/1.91
% 3.71/1.91 Simplification rules
% 3.71/1.91 ----------------------
% 3.71/1.91 #Subsume : 3
% 3.71/1.91 #Demod : 2
% 3.71/1.91 #Tautology : 12
% 3.71/1.91 #SimpNegUnit : 2
% 3.71/1.91 #BackRed : 0
% 3.71/1.91
% 3.71/1.91 #Partial instantiations: 0
% 3.71/1.91 #Strategies tried : 1
% 3.71/1.91
% 3.71/1.91 Timing (in seconds)
% 3.71/1.91 ----------------------
% 3.71/1.91 Preprocessing : 0.60
% 3.71/1.91 Parsing : 0.30
% 3.71/1.91 CNF conversion : 0.04
% 3.71/1.91 Main loop : 0.26
% 3.71/1.91 Inferencing : 0.10
% 3.71/1.91 Reduction : 0.06
% 3.71/1.92 Demodulation : 0.04
% 3.71/1.92 BG Simplification : 0.06
% 3.71/1.92 Subsumption : 0.06
% 3.71/1.92 Abstraction : 0.01
% 3.71/1.92 MUC search : 0.00
% 3.71/1.92 Cooper : 0.00
% 3.71/1.92 Total : 0.89
% 3.71/1.92 Index Insertion : 0.00
% 3.71/1.92 Index Deletion : 0.00
% 3.71/1.92 Index Matching : 0.00
% 3.71/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------