TSTP Solution File: DAT081_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT081_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:07 EDT 2023
% Result : Theorem 3.23s 1.74s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 27 ( 7 unt; 17 typ; 0 def)
% Number of atoms : 13 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 19 ( 5 atm; 0 fun; 8 num; 6 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > in > count > cons > append > #nlpp > tail > length > head > nil > #skF_4 > #skF_1 > #skF_2 > #skF_6 > #skF_3 > #skF_5
%Foreground sorts:
tff(list,type,
list: $tType ).
%Background operators:
tff('#skF_7',type,
'#skF_7': $int ).
%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(length,type,
length: list > $int ).
tff('#skF_4',type,
'#skF_4': ( $int * list ) > list ).
tff(append,type,
append: ( list * list ) > list ).
tff(count,type,
count: ( $int * list ) > $int ).
tff(cons,type,
cons: ( $int * list ) > list ).
tff(in,type,
in: ( $int * list ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $int * list ) > $int ).
tff('#skF_2',type,
'#skF_2': ( $int * list ) > list ).
tff('#skF_6',type,
'#skF_6': ( $int * list ) > list ).
tff('#skF_3',type,
'#skF_3': ( $int * list ) > $int ).
tff('#skF_5',type,
'#skF_5': ( $int * list ) > $int ).
tff(f_75,axiom,
! [Ka: $int] : ( count(Ka,nil) = 0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
tff(f_97,negated_conjecture,
~ ! [Aa: $int] : ~ in(Aa,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f_93,axiom,
! [Na: $int,L: list] :
( in(Na,L)
<=> $greater(count(Na,L),0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_8) ).
tff(c_66,plain,
! [K_32a: $int] : ( count(K_32a,nil) = 0 ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_60,plain,
in('#skF_7',nil),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_50,plain,
! [N_45a: $int,L_46: list] :
( $greater(count(N_45a,L_46),0)
| ~ in(N_45a,L_46) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_168,plain,
! [N_69a: $int,L_70: list] :
( $less(0,count(N_69a,L_70))
| ~ in(N_69a,L_70) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_50]) ).
tff(c_180,plain,
$less(0,count('#skF_7',nil)),
inference(resolution,[status(thm)],[c_60,c_168]) ).
tff(c_188,plain,
$less(0,0),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_180]) ).
tff(c_191,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT081_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.13/0.35 % Computer : n005.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 : Thu Aug 3 13:11:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.23/1.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.23/1.74
% 3.23/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.23/1.76
% 3.23/1.76 Inference rules
% 3.23/1.76 ----------------------
% 3.23/1.76 #Ref : 0
% 3.23/1.76 #Sup : 20
% 3.23/1.76 #Fact : 0
% 3.23/1.76 #Define : 0
% 3.23/1.76 #Split : 0
% 3.23/1.76 #Chain : 0
% 3.23/1.76 #Close : 0
% 3.23/1.76
% 3.23/1.76 Ordering : LPO
% 3.23/1.76
% 3.23/1.76 Simplification rules
% 3.23/1.76 ----------------------
% 3.23/1.76 #Subsume : 0
% 3.23/1.77 #Demod : 3
% 3.23/1.77 #Tautology : 17
% 3.23/1.77 #SimpNegUnit : 2
% 3.23/1.77 #BackRed : 0
% 3.23/1.77
% 3.23/1.77 #Partial instantiations: 0
% 3.23/1.77 #Strategies tried : 1
% 3.23/1.77
% 3.23/1.77 Timing (in seconds)
% 3.23/1.77 ----------------------
% 3.34/1.77 Preprocessing : 0.57
% 3.34/1.77 Parsing : 0.29
% 3.34/1.77 CNF conversion : 0.04
% 3.34/1.77 Main loop : 0.18
% 3.34/1.77 Inferencing : 0.06
% 3.34/1.77 Reduction : 0.06
% 3.34/1.77 Demodulation : 0.04
% 3.34/1.77 BG Simplification : 0.04
% 3.34/1.77 Subsumption : 0.04
% 3.34/1.77 Abstraction : 0.01
% 3.34/1.77 MUC search : 0.00
% 3.34/1.77 Cooper : 0.00
% 3.34/1.77 Total : 0.78
% 3.34/1.77 Index Insertion : 0.00
% 3.34/1.77 Index Deletion : 0.00
% 3.34/1.77 Index Matching : 0.00
% 3.34/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------