TSTP Solution File: DAT094_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT094_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 : n009.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:08 EDT 2023
% Result : Theorem 4.27s 2.26s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of formulae : 45 ( 12 unt; 16 typ; 0 def)
% Number of atoms : 54 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 25 ~; 23 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 136 ( 42 atm; 19 fun; 64 num; 11 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 : 20 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 44 (; 44 !; 0 ?; 44 :)
% 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_70,axiom,
length(nil) = 0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(f_87,axiom,
! [L: list] : ( append(nil,L) = L ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_6) ).
tff(f_89,axiom,
! [Ia: $int,K: list,L: list] : ( append(cons(Ia,K),L) = cons(Ia,append(K,L)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_7) ).
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(f_101,negated_conjecture,
~ ~ ! [K: list,L: list] :
( ( $greater(length(K),1)
& $greater(length(L),1) )
=> $greater(length(append(K,L)),4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(c_66,plain,
length(nil) = 0,
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_46,plain,
! [L_41: list] : ( append(nil,L_41) = L_41 ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_229,plain,
! [I_83a: $int,K_84: list,L_85: list] : ( cons(I_83a,append(K_84,L_85)) = append(cons(I_83a,K_84),L_85) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_307,plain,
! [I_95a: $int,L_96: list] : ( cons(I_95a,L_96) = append(cons(I_95a,nil),L_96) ),
inference(superposition,[status(thm),theory(equality)],[c_46,c_229]) ).
tff(c_65,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_384,plain,
! [I_95a: $int,L_96: list] : ( length(append(cons(I_95a,nil),L_96)) = $sum(1,length(L_96)) ),
inference(superposition,[status(thm),theory(equality)],[c_307,c_65]) ).
tff(c_1000,plain,
! [I_187a: $int,K_188: list,L_189: list] : ( length(append(cons(I_187a,K_188),L_189)) = $sum(1,length(append(K_188,L_189))) ),
inference(superposition,[status(thm),theory(equality)],[c_229,c_65]) ).
tff(c_56,plain,
! [K_47: list,L_48: list] :
( $greater(length(append(K_47,L_48)),4)
| ~ $greater(length(L_48),1)
| ~ $greater(length(K_47),1) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_58,plain,
! [K_47: list,L_48: list] :
( $less(4,length(append(K_47,L_48)))
| ~ $less(1,length(L_48))
| ~ $less(1,length(K_47)) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_56]) ).
tff(c_1010,plain,
! [K_188: list,L_189: list,I_187a: $int] :
( $less(4,$sum(1,length(append(K_188,L_189))))
| ~ $less(1,length(L_189))
| ~ $less(1,length(cons(I_187a,K_188))) ),
inference(superposition,[status(thm),theory(equality)],[c_1000,c_58]) ).
tff(c_1029,plain,
! [K_188: list,L_189: list] :
( $less(4,$sum(1,length(append(K_188,L_189))))
| ~ $less(1,length(L_189))
| ~ $less(1,$sum(1,length(K_188))) ),
inference(demodulation,[status(thm),theory(equality)],[c_65,c_1010]) ).
tff(c_1299,plain,
! [K_199: list,L_200: list] :
( $less(3,length(append(K_199,L_200)))
| ~ $less(1,length(L_200))
| ~ $less(0,length(K_199)) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1029]) ).
tff(c_1311,plain,
! [L_96: list,I_95a: $int] :
( $less(3,$sum(1,length(L_96)))
| ~ $less(1,length(L_96))
| ~ $less(0,length(cons(I_95a,nil))) ),
inference(superposition,[status(thm),theory(equality)],[c_384,c_1299]) ).
tff(c_1327,plain,
! [L_96: list] :
( $less(3,$sum(1,length(L_96)))
| ~ $less(1,length(L_96))
| ~ $less(0,$sum(1,0)) ),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_65,c_1311]) ).
tff(c_1338,plain,
! [L_201: list] :
( $less(2,length(L_201))
| ~ $less(1,length(L_201)) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1327]) ).
tff(c_1344,plain,
! [L_96: list,I_95a: $int] :
( $less(2,$sum(1,length(L_96)))
| ~ $less(1,length(append(cons(I_95a,nil),L_96))) ),
inference(superposition,[status(thm),theory(equality)],[c_384,c_1338]) ).
tff(c_1354,plain,
! [L_96: list] :
( $less(2,$sum(1,length(L_96)))
| ~ $less(1,$sum(1,length(L_96))) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_1344]) ).
tff(c_1363,plain,
! [L_202: list] :
( $less(1,length(L_202))
| ~ $less(0,length(L_202)) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1354]) ).
tff(c_1369,plain,
! [L_96: list,I_95a: $int] :
( $less(1,$sum(1,length(L_96)))
| ~ $less(0,length(append(cons(I_95a,nil),L_96))) ),
inference(superposition,[status(thm),theory(equality)],[c_384,c_1363]) ).
tff(c_1379,plain,
! [L_96: list] :
( $less(1,$sum(1,length(L_96)))
| ~ $less(0,$sum(1,length(L_96))) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_1369]) ).
tff(c_1439,plain,
! [L_205: list] :
( $less(0,length(L_205))
| ~ $less($uminus(1),length(L_205)) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1379]) ).
tff(c_1451,plain,
( $less(0,length(nil))
| ~ $less($uminus(1),0) ),
inference(superposition,[status(thm),theory(equality)],[c_66,c_1439]) ).
tff(c_1461,plain,
( $less(0,0)
| ~ $less($uminus(1),0) ),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_1451]) ).
tff(c_1464,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1461]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT094_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/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.14/0.35 % Computer : n009.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:07:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.27/2.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.27/2.27
% 4.27/2.27 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.27/2.30
% 4.27/2.30 Inference rules
% 4.27/2.30 ----------------------
% 4.27/2.30 #Ref : 0
% 4.27/2.30 #Sup : 286
% 4.27/2.30 #Fact : 0
% 4.27/2.30 #Define : 0
% 4.27/2.30 #Split : 0
% 4.27/2.30 #Chain : 0
% 4.27/2.30 #Close : 0
% 4.27/2.30
% 4.27/2.30 Ordering : LPO
% 4.27/2.30
% 4.27/2.30 Simplification rules
% 4.27/2.30 ----------------------
% 4.27/2.30 #Subsume : 24
% 4.27/2.30 #Demod : 142
% 4.27/2.30 #Tautology : 131
% 4.27/2.30 #SimpNegUnit : 12
% 4.27/2.30 #BackRed : 1
% 4.27/2.30
% 4.27/2.30 #Partial instantiations: 0
% 4.27/2.30 #Strategies tried : 1
% 4.27/2.30
% 4.27/2.30 Timing (in seconds)
% 4.27/2.30 ----------------------
% 4.27/2.30 Preprocessing : 0.60
% 4.27/2.30 Parsing : 0.32
% 4.27/2.30 CNF conversion : 0.04
% 4.27/2.30 Main loop : 0.57
% 4.27/2.30 Inferencing : 0.20
% 4.27/2.30 Reduction : 0.18
% 4.27/2.30 Demodulation : 0.13
% 4.27/2.30 BG Simplification : 0.07
% 4.27/2.30 Subsumption : 0.10
% 4.27/2.30 Abstraction : 0.03
% 4.27/2.30 MUC search : 0.00
% 4.27/2.30 Cooper : 0.00
% 4.27/2.30 Total : 1.22
% 4.27/2.30 Index Insertion : 0.00
% 4.27/2.30 Index Deletion : 0.00
% 4.27/2.30 Index Matching : 0.00
% 4.27/2.30 BG Taut test : 0.00
%------------------------------------------------------------------------------