TSTP Solution File: DAT095_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT095_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 : n029.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:09 EDT 2023
% Result : Theorem 3.93s 2.02s
% Output : CNFRefutation 4.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 36 ( 9 unt; 16 typ; 0 def)
% Number of atoms : 35 ( 14 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 26 ( 11 ~; 8 |; 3 &)
% ( 2 <=>; 1 =>; 1 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 50 ( 8 atm; 4 fun; 12 num; 26 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 : 16 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 51 (; 47 !; 4 ?; 51 :)
% 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_93,axiom,
! [Na: $int,L: list] :
( in(Na,L)
<=> $greater(count(Na,L),0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_8) ).
tff(f_101,negated_conjecture,
~ ~ ! [Ma: $int,Na: $int,L: list,L1: list] :
( ( in(Na,L)
& ( L1 = cons(Ma,L) ) )
=> ( count(Na,L1) = count(Na,L) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f_84,axiom,
! [Ka: $int,Ha: $int,T: list,Na: $int] :
( ( count(Ka,cons(Ha,T)) = $sum(count(Ka,T),1) )
<= ( Ka = Ha ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_4) ).
tff(f_89,axiom,
! [Ia: $int,K: list,L: list] : ( append(cons(Ia,K),L) = cons(Ia,append(K,L)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_7) ).
tff(f_54,axiom,
! [Xa: $int,L: list] :
( in(Xa,L)
<=> ( ? [Ha: $int,T: list] :
( ( L = cons(Ha,T) )
& ( Xa = Ha ) )
| ? [Ha: $int,T: list] :
( ( L = cons(Ha,T) )
& in(Xa,T) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_conv) ).
tff(c_53,plain,
! [N_45a: $int,L_46: list] :
( in(N_45a,L_46)
| ~ $greater(count(N_45a,L_46),0) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_141,plain,
! [N_68a: $int,L_69: list] :
( in(N_68a,L_69)
| ~ $less(0,count(N_68a,L_69)) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_53]) ).
tff(c_57,plain,
! [N_48a: $int,M_47a: $int,L_49: list] :
( ( count(N_48a,cons(M_47a,L_49)) = count(N_48a,L_49) )
| ~ in(N_48a,L_49) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_503,plain,
! [N_109a: $int,M_110a: $int,L_111: list] :
( ( count(N_109a,cons(M_110a,L_111)) = count(N_109a,L_111) )
| ~ $less(0,count(N_109a,L_111)) ),
inference(resolution,[status(thm)],[c_141,c_57]) ).
tff(c_43,plain,
! [H_38a: $int,T_39: list] : ( count(H_38a,cons(H_38a,T_39)) = $sum(count(H_38a,T_39),1) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_61,plain,
! [H_38a: $int,T_39: list] : ( count(H_38a,cons(H_38a,T_39)) = $sum(1,count(H_38a,T_39)) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_43]) ).
tff(c_512,plain,
! [M_110a: $int,L_111: list] :
( ( $sum(1,count(M_110a,L_111)) = count(M_110a,L_111) )
| ~ $less(0,count(M_110a,L_111)) ),
inference(superposition,[status(thm),theory(equality)],[c_503,c_61]) ).
tff(c_536,plain,
! [M_110a: $int,L_111: list] : ~ $less(0,count(M_110a,L_111)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_512]) ).
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_59,plain,
! [N_45a: $int,L_46: list] :
( $less(0,count(N_45a,L_46))
| ~ in(N_45a,L_46) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_50]) ).
tff(c_549,plain,
! [N_45a: $int,L_46: list] : ~ in(N_45a,L_46),
inference(negUnitSimplification,[status(thm)],[c_536,c_59]) ).
tff(c_264,plain,
! [I_89a: $int,K_90: list,L_91: list] : ( cons(I_89a,append(K_90,L_91)) = append(cons(I_89a,K_90),L_91) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_72,plain,
! [H_18a: $int,T_19: list] : in(H_18a,cons(H_18a,T_19)),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_309,plain,
! [I_89a: $int,K_90: list,L_91: list] : in(I_89a,append(cons(I_89a,K_90),L_91)),
inference(superposition,[status(thm),theory(equality)],[c_264,c_72]) ).
tff(c_564,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_549,c_309]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT095_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/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.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 13:29:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.93/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.93/2.02
% 3.93/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.08/2.05
% 4.08/2.05 Inference rules
% 4.08/2.05 ----------------------
% 4.08/2.05 #Ref : 0
% 4.08/2.05 #Sup : 100
% 4.08/2.05 #Fact : 0
% 4.08/2.05 #Define : 0
% 4.08/2.05 #Split : 0
% 4.08/2.05 #Chain : 0
% 4.08/2.05 #Close : 0
% 4.08/2.05
% 4.08/2.05 Ordering : LPO
% 4.08/2.05
% 4.08/2.05 Simplification rules
% 4.08/2.05 ----------------------
% 4.08/2.05 #Subsume : 8
% 4.08/2.05 #Demod : 17
% 4.08/2.05 #Tautology : 54
% 4.08/2.05 #SimpNegUnit : 8
% 4.08/2.05 #BackRed : 5
% 4.08/2.05
% 4.08/2.05 #Partial instantiations: 0
% 4.08/2.05 #Strategies tried : 1
% 4.08/2.05
% 4.08/2.05 Timing (in seconds)
% 4.08/2.05 ----------------------
% 4.08/2.05 Preprocessing : 0.62
% 4.08/2.05 Parsing : 0.33
% 4.08/2.05 CNF conversion : 0.04
% 4.08/2.05 Main loop : 0.34
% 4.09/2.05 Inferencing : 0.13
% 4.09/2.05 Reduction : 0.10
% 4.09/2.05 Demodulation : 0.07
% 4.09/2.05 BG Simplification : 0.05
% 4.09/2.05 Subsumption : 0.06
% 4.09/2.05 Abstraction : 0.02
% 4.09/2.05 MUC search : 0.00
% 4.09/2.05 Cooper : 0.00
% 4.09/2.06 Total : 1.00
% 4.09/2.06 Index Insertion : 0.00
% 4.09/2.06 Index Deletion : 0.00
% 4.09/2.06 Index Matching : 0.00
% 4.09/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------