TSTP Solution File: DAT084_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT084_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/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 : n002.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.33s 1.83s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 32 ( 13 unt; 19 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 14 ( 0 atm; 4 fun; 8 num; 2 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 16 usr; 5 con; 0-2 aty)
% Number of variables : 5 (; 4 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > in > count > cons > append > #nlpp > tail > length > head > nil > #skF_4 > #skF_7 > #skF_1 > #skF_2 > #skF_6 > #skF_3 > #skF_5
%Foreground sorts:
tff(list,type,
list: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $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('#skF_7',type,
'#skF_7': 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_97,negated_conjecture,
~ ~ ? [L: list] : ( length(L) = length(cons(1,L)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f_72,axiom,
! [Ha: $int,T: list] : ( length(cons(Ha,T)) = $sum(1,length(T)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_1) ).
tff(c_57,plain,
length(cons(1,'#skF_7')) = length('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_130,plain,
length('#skF_7') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_57]) ).
tff(c_129,plain,
length(cons(1,'#skF_7')) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_57]) ).
tff(c_135,plain,
'#skE_2' = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_130,c_129,c_57]) ).
tff(c_134,plain,
length('#skF_7') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_57]) ).
tff(c_137,plain,
length('#skF_7') = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_135,c_134]) ).
tff(c_150,plain,
! [H_58a: $int,T_59: list] : ( length(cons(H_58a,T_59)) = $sum(1,length(T_59)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_133,plain,
length(cons(1,'#skF_7')) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_57]) ).
tff(c_156,plain,
$sum(1,length('#skF_7')) = '#skE_1',
inference(superposition,[status(thm),theory(equality)],[c_150,c_133]) ).
tff(c_165,plain,
$sum(1,'#skE_1') = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_137,c_156]) ).
tff(c_168,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT084_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/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.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 13:27:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.33/1.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.33/1.83
% 3.33/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.33/1.85
% 3.33/1.85 Inference rules
% 3.33/1.85 ----------------------
% 3.33/1.85 #Ref : 0
% 3.33/1.85 #Sup : 18
% 3.33/1.85 #Fact : 0
% 3.33/1.85 #Define : 2
% 3.33/1.85 #Split : 0
% 3.33/1.85 #Chain : 0
% 3.33/1.85 #Close : 0
% 3.33/1.85
% 3.33/1.85 Ordering : LPO
% 3.33/1.85
% 3.33/1.85 Simplification rules
% 3.33/1.85 ----------------------
% 3.33/1.85 #Subsume : 0
% 3.33/1.85 #Demod : 4
% 3.33/1.86 #Tautology : 15
% 3.33/1.86 #SimpNegUnit : 0
% 3.33/1.86 #BackRed : 0
% 3.33/1.86
% 3.33/1.86 #Partial instantiations: 0
% 3.33/1.86 #Strategies tried : 1
% 3.33/1.86
% 3.33/1.86 Timing (in seconds)
% 3.33/1.86 ----------------------
% 3.33/1.86 Preprocessing : 0.61
% 3.33/1.86 Parsing : 0.32
% 3.33/1.86 CNF conversion : 0.04
% 3.33/1.86 Main loop : 0.19
% 3.33/1.86 Inferencing : 0.04
% 3.33/1.86 Reduction : 0.06
% 3.33/1.86 Demodulation : 0.05
% 3.33/1.86 BG Simplification : 0.04
% 3.33/1.86 Subsumption : 0.04
% 3.33/1.86 Abstraction : 0.01
% 3.33/1.86 MUC search : 0.00
% 3.33/1.86 Cooper : 0.01
% 3.33/1.86 Total : 0.85
% 3.33/1.86 Index Insertion : 0.00
% 3.33/1.86 Index Deletion : 0.00
% 3.33/1.86 Index Matching : 0.00
% 3.33/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------