TSTP Solution File: DAT044_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT044_1 : TPTP v8.1.2. Released v5.0.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 : n028.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:02 EDT 2023
% Result : Theorem 3.79s 1.91s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 30 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 30 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 7 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 37 ( 12 atm; 8 fun; 8 num; 9 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > count > empty > #skF_1
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_2',type,
'#skF_2': $int ).
%Foreground operators:
tff(empty,type,
empty: collection ).
tff(count,type,
count: collection > $int ).
tff('#skF_1',type,
'#skF_1': collection ).
tff(in,type,
in: ( $int * collection ) > $o ).
tff(remove,type,
remove: ( $int * collection ) > collection ).
tff(add,type,
add: ( $int * collection ) > collection ).
tff(f_145,negated_conjecture,
~ ! [U: collection,Va: $int] :
( ! [Wa: $int] :
( in(Wa,U)
=> $greater(Va,Wa) )
=> $greater(count(add(Va,U)),count(U)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_118,axiom,
! [X8a: $int,X9: collection] :
( ~ in(X8a,X9)
<=> ( count(add(X8a,X9)) = $sum(count(X9),1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT002=1.ax',ax3) ).
tff(c_47,plain,
~ $greater(count(add('#skF_2','#skF_1')),count('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_55,plain,
~ $less(count('#skF_1'),count(add('#skF_2','#skF_1'))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_47]) ).
tff(c_109,plain,
count('#skF_1') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_55]) ).
tff(c_25,plain,
! [X8_14a: $int,X9_15: collection] :
( ( count(add(X8_14a,X9_15)) = $sum(count(X9_15),1) )
| in(X8_14a,X9_15) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_443,plain,
! [X8_73a: $int,X9_74: collection] :
( ( count(add(X8_73a,X9_74)) = $sum(1,count(X9_74)) )
| in(X8_73a,X9_74) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_25]) ).
tff(c_49,plain,
! [W_25a: $int] :
( ~ in(W_25a,'#skF_1')
| $greater('#skF_2',W_25a) ),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_51,plain,
! [W_25a: $int] :
( ~ in(W_25a,'#skF_1')
| $less(W_25a,'#skF_2') ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_49]) ).
tff(c_464,plain,
! [X8_73a: $int] :
( $less(X8_73a,'#skF_2')
| ( count(add(X8_73a,'#skF_1')) = $sum(1,count('#skF_1')) ) ),
inference(resolution,[status(thm)],[c_443,c_51]) ).
tff(c_540,plain,
! [X8_80a: $int] :
( $less(X8_80a,'#skF_2')
| ( count(add(X8_80a,'#skF_1')) = $sum(1,'#skE_1') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_109,c_464]) ).
tff(c_112,plain,
count(add('#skF_2','#skF_1')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_55]) ).
tff(c_565,plain,
( ( '#skE_2' = $sum(1,'#skE_1') )
| $less('#skF_2','#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_540,c_112]) ).
tff(c_567,plain,
'#skE_2' = $sum(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_565]) ).
tff(c_105,plain,
count(add('#skF_2','#skF_1')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_55]) ).
tff(c_104,plain,
count('#skF_1') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_55]) ).
tff(c_77,plain,
~ $less(count('#skF_1'),count(add('#skF_2','#skF_1'))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_47]) ).
tff(c_113,plain,
~ $less('#skE_1','#skE_2'),
inference(demodulation,[status(thm),theory(equality)],[c_105,c_104,c_77]) ).
tff(c_591,plain,
~ $less('#skE_1',$sum(1,'#skE_1')),
inference(demodulation,[status(thm),theory(equality)],[c_567,c_113]) ).
tff(c_597,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT044_1 : TPTP v8.1.2. Released v5.0.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.17/0.35 % Computer : n028.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 13:28:24 EDT 2023
% 0.17/0.35 % CPUTime :
% 3.79/1.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.79/1.92
% 3.79/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.85/1.94
% 3.85/1.94 Inference rules
% 3.85/1.94 ----------------------
% 3.85/1.94 #Ref : 0
% 3.85/1.94 #Sup : 94
% 3.85/1.94 #Fact : 0
% 3.85/1.94 #Define : 2
% 3.85/1.94 #Split : 2
% 3.85/1.94 #Chain : 0
% 3.85/1.94 #Close : 0
% 3.85/1.94
% 3.85/1.94 Ordering : LPO
% 3.85/1.94
% 3.85/1.94 Simplification rules
% 3.85/1.94 ----------------------
% 3.85/1.94 #Subsume : 9
% 3.85/1.94 #Demod : 32
% 3.85/1.94 #Tautology : 44
% 3.85/1.94 #SimpNegUnit : 2
% 3.85/1.94 #BackRed : 5
% 3.85/1.94
% 3.85/1.94 #Partial instantiations: 0
% 3.85/1.94 #Strategies tried : 1
% 3.85/1.94
% 3.85/1.94 Timing (in seconds)
% 3.85/1.94 ----------------------
% 3.85/1.94 Preprocessing : 0.54
% 3.85/1.94 Parsing : 0.28
% 3.85/1.94 CNF conversion : 0.03
% 3.85/1.94 Main loop : 0.36
% 3.85/1.94 Inferencing : 0.12
% 3.85/1.94 Reduction : 0.09
% 3.85/1.94 Demodulation : 0.06
% 3.85/1.94 BG Simplification : 0.05
% 3.85/1.94 Subsumption : 0.07
% 3.85/1.95 Abstraction : 0.02
% 3.85/1.95 MUC search : 0.00
% 3.85/1.95 Cooper : 0.02
% 3.85/1.95 Total : 0.94
% 3.85/1.95 Index Insertion : 0.00
% 3.85/1.95 Index Deletion : 0.00
% 3.85/1.95 Index Matching : 0.00
% 3.85/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------