TSTP Solution File: DAT082_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT082_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 : n018.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 2.95s 1.63s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 19
% Syntax : Number of formulae : 25 ( 9 unt; 16 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 20 ( 0 atm; 4 fun; 14 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 : 17 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 4 :)
% 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:
%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_72,axiom,
! [Ha: $int,T: list] : ( length(cons(Ha,T)) = $sum(1,length(T)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_1) ).
tff(f_95,negated_conjecture,
length(cons(1,cons(2,nil))) != 2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f_70,axiom,
length(nil) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(c_64,plain,
! [H_30a: $int,T_31: list] : ( length(cons(H_30a,T_31)) = $sum(1,length(T_31)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_57,plain,
length(cons(1,cons(2,nil))) != 2,
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_82,plain,
$sum(1,$sum(1,length(nil))) != 2,
inference(demodulation,[status(thm),theory(equality)],[c_64,c_64,c_57]) ).
tff(c_84,plain,
length(nil) != 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_82]) ).
tff(c_65,plain,
length(nil) = 0,
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_85,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_84,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT082_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 : n018.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.36 % DateTime : Thu Aug 3 13:20:36 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.95/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.95/1.63
% 2.95/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.95/1.65
% 2.95/1.65 Inference rules
% 2.95/1.65 ----------------------
% 2.95/1.65 #Ref : 0
% 2.95/1.65 #Sup : 0
% 2.95/1.65 #Fact : 0
% 2.95/1.65 #Define : 0
% 2.95/1.65 #Split : 0
% 2.95/1.65 #Chain : 0
% 2.95/1.65 #Close : 0
% 2.95/1.65
% 2.95/1.65 Ordering : LPO
% 2.95/1.65
% 2.95/1.65 Simplification rules
% 2.95/1.65 ----------------------
% 2.95/1.65 #Subsume : 25
% 2.95/1.65 #Demod : 2
% 2.95/1.65 #Tautology : 0
% 2.95/1.65 #SimpNegUnit : 1
% 2.95/1.65 #BackRed : 0
% 2.95/1.65
% 2.95/1.65 #Partial instantiations: 0
% 2.95/1.65 #Strategies tried : 1
% 2.95/1.65
% 2.95/1.65 Timing (in seconds)
% 2.95/1.65 ----------------------
% 2.95/1.66 Preprocessing : 0.56
% 2.95/1.66 Parsing : 0.29
% 2.95/1.66 CNF conversion : 0.04
% 2.95/1.66 Main loop : 0.06
% 2.95/1.66 Inferencing : 0.00
% 2.95/1.66 Reduction : 0.03
% 2.95/1.66 Demodulation : 0.02
% 2.95/1.66 BG Simplification : 0.04
% 2.95/1.66 Subsumption : 0.03
% 2.95/1.66 Abstraction : 0.01
% 2.95/1.66 MUC search : 0.00
% 2.95/1.66 Cooper : 0.00
% 2.95/1.66 Total : 0.66
% 2.95/1.66 Index Insertion : 0.00
% 2.95/1.66 Index Deletion : 0.00
% 2.95/1.66 Index Matching : 0.00
% 2.95/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------