TSTP Solution File: DAT091_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT091_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 : n031.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 3.45s 2.00s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 29 ( 6 unt; 16 typ; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 6 |; 0 &)
% ( 0 <=>; 1 =>; 1 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 23 ( 0 atm; 0 fun; 5 num; 18 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 : 14 ( 13 usr; 2 con; 0-2 aty)
% Number of variables : 29 (; 29 !; 0 ?; 29 :)
% 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_75,axiom,
! [Ka: $int] : ( count(Ka,nil) = 0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).
tff(f_41,axiom,
! [Ka: $int,L: list] : ( cons(Ka,L) != nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).
tff(f_80,axiom,
! [Ka: $int,Ha: $int,T: list,Na: $int] :
( ( count(Ka,cons(Ha,T)) = count(Ka,T) )
<= ( Ka != Ha ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_3) ).
tff(f_102,negated_conjecture,
~ ~ ! [L1: list,L2: list] :
( ( L1 != L2 )
=> ! [Na: $int] : ( count(Na,L1) != count(Na,L2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(c_63,plain,
! [K_32a: $int] : ( count(K_32a,nil) = 0 ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_78,plain,
! [K_6a: $int,L_7: list] : ( cons(K_6a,L_7) != nil ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_199,plain,
! [K_79a: $int,H_80a: $int,T_81: list] :
( ( count(K_79a,cons(H_80a,T_81)) = count(K_79a,T_81) )
| ( K_79a = H_80a ) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_134,plain,
! [N_65a: $int,L2_66: list,L1_67: list] :
( ( count(N_65a,L2_66) != count(N_65a,L1_67) )
| ( L2_66 = L1_67 ) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_141,plain,
! [K_32a: $int,L1_67: list] :
( ( count(K_32a,L1_67) != 0 )
| ( nil = L1_67 ) ),
inference(superposition,[status(thm),theory(equality)],[c_63,c_134]) ).
tff(c_209,plain,
! [K_79a: $int,T_81: list,H_80a: $int] :
( ( count(K_79a,T_81) != 0 )
| ( cons(H_80a,T_81) = nil )
| ( K_79a = H_80a ) ),
inference(superposition,[status(thm),theory(equality)],[c_199,c_141]) ).
tff(c_229,plain,
! [K_82a: $int,T_83: list,H_84a: $int] :
( ( count(K_82a,T_83) != 0 )
| ( K_82a = H_84a ) ),
inference(negUnitSimplification,[status(thm)],[c_78,c_209]) ).
tff(c_237,plain,
! [K_32a: $int,H_84a: $int] : ( K_32a = H_84a ),
inference(superposition,[status(thm),theory(equality)],[c_63,c_229]) ).
tff(c_259,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : DAT091_1 : TPTP v8.1.2. Released v6.1.0.
% 0.14/0.15 % 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.37 % Computer : n031.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 13:38:14 EDT 2023
% 0.14/0.37 % CPUTime :
% 3.45/2.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/2.01
% 3.45/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.45/2.03
% 3.45/2.03 Inference rules
% 3.45/2.03 ----------------------
% 3.45/2.03 #Ref : 2
% 3.45/2.03 #Sup : 34
% 3.45/2.03 #Fact : 0
% 3.45/2.03 #Define : 0
% 3.45/2.03 #Split : 0
% 3.45/2.03 #Chain : 0
% 3.45/2.03 #Close : 0
% 3.45/2.03
% 3.45/2.03 Ordering : LPO
% 3.45/2.03
% 3.45/2.03 Simplification rules
% 3.45/2.03 ----------------------
% 3.45/2.03 #Subsume : 7
% 3.45/2.03 #Demod : 2
% 3.45/2.03 #Tautology : 22
% 3.45/2.03 #SimpNegUnit : 4
% 3.45/2.03 #BackRed : 0
% 3.45/2.03
% 3.45/2.03 #Partial instantiations: 0
% 3.45/2.03 #Strategies tried : 1
% 3.45/2.03
% 3.45/2.03 Timing (in seconds)
% 3.45/2.03 ----------------------
% 3.45/2.04 Preprocessing : 0.63
% 3.45/2.04 Parsing : 0.34
% 3.45/2.04 CNF conversion : 0.04
% 3.45/2.04 Main loop : 0.25
% 3.45/2.04 Inferencing : 0.08
% 3.45/2.04 Reduction : 0.07
% 3.45/2.04 Demodulation : 0.05
% 3.45/2.04 BG Simplification : 0.04
% 3.45/2.04 Subsumption : 0.05
% 3.45/2.04 Abstraction : 0.01
% 3.45/2.04 MUC search : 0.00
% 3.45/2.04 Cooper : 0.01
% 3.45/2.04 Total : 0.93
% 3.45/2.04 Index Insertion : 0.00
% 3.45/2.04 Index Deletion : 0.00
% 3.45/2.04 Index Matching : 0.00
% 3.45/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------