TSTP Solution File: DAT041_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT041_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/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 : 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:01 EDT 2023
% Result : Theorem 3.71s 1.93s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 14 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 22 ( 4 atm; 4 fun; 4 num; 10 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 : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 19 (; 17 !; 2 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > count > empty
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
%Foreground operators:
tff(empty,type,
empty: collection ).
tff(count,type,
count: collection > $int ).
tff(in,type,
in: ( $int * collection ) > $o ).
tff(remove,type,
remove: ( $int * collection ) > collection ).
tff(add,type,
add: ( $int * collection ) > collection ).
tff(f_71,axiom,
! [Za: $int,X1: collection,X2a: $int] :
( ( in(Za,X1)
| ( Za = X2a ) )
<=> in(Za,add(X2a,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4) ).
tff(f_122,axiom,
! [X10a: $int,X11: collection] :
( in(X10a,X11)
<=> ( count(add(X10a,X11)) = count(X11) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax4) ).
tff(f_140,negated_conjecture,
~ ? [U: collection,Va: $int] : $greater($sum(count(U),1),count(add(Va,U))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(c_66,plain,
! [X2_8a: $int,X1_7: collection] : in(X2_8a,add(X2_8a,X1_7)),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_207,plain,
! [X10_52a: $int,X11_53: collection] :
( ( count(add(X10_52a,X11_53)) = count(X11_53) )
| ~ in(X10_52a,X11_53) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_370,plain,
! [X2_68a: $int,X1_69: collection] : ( count(add(X2_68a,add(X2_68a,X1_69))) = count(add(X2_68a,X1_69)) ),
inference(resolution,[status(thm)],[c_66,c_207]) ).
tff(c_47,plain,
! [U_24: collection,V_25a: $int] : ~ $greater($sum(count(U_24),1),count(add(V_25a,U_24))),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_49,plain,
! [V_25a: $int,U_24: collection] : ~ $less(count(add(V_25a,U_24)),$sum(1,count(U_24))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_47]) ).
tff(c_376,plain,
! [X2_68a: $int,X1_69: collection] : ~ $less(count(add(X2_68a,X1_69)),$sum(1,count(add(X2_68a,X1_69)))),
inference(superposition,[status(thm),theory(equality)],[c_370,c_49]) ).
tff(c_395,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_376]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT041_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 13:29:22 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.71/1.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.71/1.93
% 3.71/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.86/1.96
% 3.86/1.96 Inference rules
% 3.86/1.96 ----------------------
% 3.86/1.96 #Ref : 0
% 3.86/1.96 #Sup : 65
% 3.86/1.96 #Fact : 0
% 3.86/1.96 #Define : 0
% 3.86/1.96 #Split : 0
% 3.86/1.96 #Chain : 0
% 3.86/1.96 #Close : 0
% 3.86/1.96
% 3.86/1.96 Ordering : LPO
% 3.86/1.96
% 3.86/1.96 Simplification rules
% 3.86/1.96 ----------------------
% 3.86/1.96 #Subsume : 6
% 3.86/1.96 #Demod : 17
% 3.86/1.96 #Tautology : 26
% 3.86/1.96 #SimpNegUnit : 2
% 3.86/1.96 #BackRed : 1
% 3.86/1.96
% 3.86/1.96 #Partial instantiations: 0
% 3.86/1.96 #Strategies tried : 1
% 3.86/1.96
% 3.86/1.96 Timing (in seconds)
% 3.86/1.96 ----------------------
% 3.86/1.96 Preprocessing : 0.60
% 3.86/1.96 Parsing : 0.33
% 3.86/1.96 CNF conversion : 0.03
% 3.86/1.96 Main loop : 0.32
% 3.86/1.96 Inferencing : 0.12
% 3.86/1.96 Reduction : 0.08
% 3.86/1.96 Demodulation : 0.06
% 3.86/1.96 BG Simplification : 0.05
% 3.86/1.96 Subsumption : 0.07
% 3.86/1.96 Abstraction : 0.02
% 3.86/1.96 MUC search : 0.00
% 3.86/1.96 Cooper : 0.00
% 3.86/1.96 Total : 0.96
% 3.86/1.96 Index Insertion : 0.00
% 3.86/1.96 Index Deletion : 0.00
% 3.86/1.96 Index Matching : 0.00
% 3.86/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------