TSTP Solution File: DAT039_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT039_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 : n017.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 5.53s 2.35s
% Output : CNFRefutation 5.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 19
% Syntax : Number of formulae : 77 ( 43 unt; 12 typ; 0 def)
% Number of atoms : 95 ( 56 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 57 ( 27 ~; 21 |; 3 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 124 ( 5 atm; 14 fun; 84 num; 21 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 : 17 ( 10 usr; 11 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?; 37 :)
% 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('#skE_4',type,
'#skE_4': $int ).
tff('#skF_2',type,
'#skF_2': $int ).
tff('#skE_3',type,
'#skE_3': $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_149,negated_conjecture,
~ ! [U: collection,Va: $int] :
( ( in(2,U)
& in(3,U)
& ( count(U) = 2 )
& $greater(Va,3) )
=> ~ in(Va,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_131,axiom,
! [X14a: $int,X15: collection] :
( ~ in(X14a,X15)
<=> ( count(remove(X14a,X15)) = count(X15) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax6) ).
tff(f_60,axiom,
! [Ua: $int] : ~ in(Ua,empty),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax1) ).
tff(f_126,axiom,
! [X12a: $int,X13: collection] :
( in(X12a,X13)
<=> ( count(remove(X12a,X13)) = $difference(count(X13),1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax5) ).
tff(f_135,axiom,
! [X16a: $int,X17: collection] :
( in(X16a,X17)
=> ( X17 = add(X16a,remove(X16a,X17)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax7) ).
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_113,axiom,
! [X7: collection] :
( ( X7 = empty )
<=> ( count(X7) = 0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax2) ).
tff(c_58,plain,
count('#skF_1') = 2,
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_63,plain,
in('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_315,plain,
! [X14_52a: $int,X15_53: collection] :
( ~ in(X14_52a,X15_53)
| ( count(remove(X14_52a,X15_53)) != count(X15_53) ) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_327,plain,
count(remove('#skF_2','#skF_1')) != count('#skF_1'),
inference(resolution,[status(thm)],[c_63,c_315]) ).
tff(c_345,plain,
count(remove('#skF_2','#skF_1')) != 2,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_327]) ).
tff(c_518,plain,
count(remove('#skF_2','#skF_1')) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_345]) ).
tff(c_57,plain,
in(3,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_330,plain,
count(remove(3,'#skF_1')) != count('#skF_1'),
inference(resolution,[status(thm)],[c_57,c_315]) ).
tff(c_348,plain,
count(remove(3,'#skF_1')) != 2,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_330]) ).
tff(c_355,plain,
count(remove(3,'#skF_1')) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_348]) ).
tff(c_546,plain,
( ( '#skE_3' = '#skE_1' )
| ( '#skF_2' != 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_518,c_355]) ).
tff(c_558,plain,
'#skF_2' != 3,
inference(splitLeft,[status(thm)],[c_546]) ).
tff(c_84,plain,
! [U_1a: $int] : ~ in(U_1a,empty),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_56,plain,
in(2,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_333,plain,
count(remove(2,'#skF_1')) != count('#skF_1'),
inference(resolution,[status(thm)],[c_56,c_315]) ).
tff(c_351,plain,
count(remove(2,'#skF_1')) != 2,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_333]) ).
tff(c_373,plain,
count(remove(2,'#skF_1')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_351]) ).
tff(c_35,plain,
! [X12_18a: $int,X13_19: collection] :
( ( count(remove(X12_18a,X13_19)) = $difference(count(X13_19),1) )
| ~ in(X12_18a,X13_19) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_1026,plain,
! [X12_94a: $int,X13_95: collection] :
( ( count(remove(X12_94a,X13_95)) = $sum($uminus(1),count(X13_95)) )
| ~ in(X12_94a,X13_95) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_35]) ).
tff(c_1053,plain,
count(remove(2,'#skF_1')) = $sum($uminus(1),count('#skF_1')),
inference(resolution,[status(thm)],[c_56,c_1026]) ).
tff(c_1078,plain,
'#skE_2' = $sum($uminus(1),2),
inference(demodulation,[status(thm),theory(equality)],[c_373,c_58,c_1053]) ).
tff(c_1080,plain,
'#skE_2' = 1,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1078]) ).
tff(c_1096,plain,
count(remove(2,'#skF_1')) = 1,
inference(demodulation,[status(thm),theory(equality)],[c_1080,c_373]) ).
tff(c_261,plain,
! [X16_48a: $int,X17_49: collection] :
( ( add(X16_48a,remove(X16_48a,X17_49)) = X17_49 )
| ~ in(X16_48a,X17_49) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_292,plain,
add(2,remove(2,'#skF_1')) = '#skF_1',
inference(resolution,[status(thm)],[c_56,c_261]) ).
tff(c_559,plain,
! [Z_66a: $int,X1_67: collection,X2_68a: $int] :
( in(Z_66a,X1_67)
| ~ in(Z_66a,add(X2_68a,X1_67))
| ( Z_66a = X2_68a ) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_599,plain,
! [Z_70a: $int] :
( in(Z_70a,remove(2,'#skF_1'))
| ~ in(Z_70a,'#skF_1')
| ( Z_70a = 2 ) ),
inference(superposition,[status(thm),theory(equality)],[c_292,c_559]) ).
tff(c_64,plain,
! [X16_22a: $int,X17_23: collection] :
( ( add(X16_22a,remove(X16_22a,X17_23)) = X17_23 )
| ~ in(X16_22a,X17_23) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_1367,plain,
! [Z_117a: $int] :
( ( add(Z_117a,remove(Z_117a,remove(2,'#skF_1'))) = remove(2,'#skF_1') )
| ~ in(Z_117a,'#skF_1')
| ( Z_117a = 2 ) ),
inference(resolution,[status(thm)],[c_599,c_64]) ).
tff(c_1410,plain,
( ( add(3,remove(3,remove(2,'#skF_1'))) = remove(2,'#skF_1') )
| ( 3 = 2 ) ),
inference(resolution,[status(thm)],[c_57,c_1367]) ).
tff(c_1412,plain,
add(3,remove(3,remove(2,'#skF_1'))) = remove(2,'#skF_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1410]) ).
tff(c_80,plain,
! [X2_8a: $int,X1_7: collection] : in(X2_8a,add(X2_8a,X1_7)),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_1480,plain,
in(3,remove(2,'#skF_1')),
inference(superposition,[status(thm),theory(equality)],[c_1412,c_80]) ).
tff(c_68,plain,
! [X12_18a: $int,X13_19: collection] :
( ( count(remove(X12_18a,X13_19)) = $sum($uminus(1),count(X13_19)) )
| ~ in(X12_18a,X13_19) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_35]) ).
tff(c_1484,plain,
count(remove(3,remove(2,'#skF_1'))) = $sum($uminus(1),count(remove(2,'#skF_1'))),
inference(resolution,[status(thm)],[c_1480,c_68]) ).
tff(c_1501,plain,
count(remove(3,remove(2,'#skF_1'))) = $sum($uminus(1),1),
inference(demodulation,[status(thm),theory(equality)],[c_1096,c_1484]) ).
tff(c_1503,plain,
count(remove(3,remove(2,'#skF_1'))) = 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1501]) ).
tff(c_73,plain,
! [X7_13: collection] :
( ( empty = X7_13 )
| ( count(X7_13) != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_1728,plain,
remove(3,remove(2,'#skF_1')) = empty,
inference(superposition,[status(thm),theory(equality)],[c_1503,c_73]) ).
tff(c_1742,plain,
remove(2,'#skF_1') = add(3,empty),
inference(demodulation,[status(thm),theory(equality)],[c_1728,c_1412]) ).
tff(c_545,plain,
( ( '#skE_3' = '#skE_2' )
| ( '#skF_2' != 2 ) ),
inference(superposition,[status(thm),theory(equality)],[c_518,c_373]) ).
tff(c_598,plain,
'#skF_2' != 2,
inference(splitLeft,[status(thm)],[c_545]) ).
tff(c_1409,plain,
( ( add('#skF_2',remove('#skF_2',remove(2,'#skF_1'))) = remove(2,'#skF_1') )
| ( '#skF_2' = 2 ) ),
inference(resolution,[status(thm)],[c_63,c_1367]) ).
tff(c_1570,plain,
add('#skF_2',remove('#skF_2',remove(2,'#skF_1'))) = remove(2,'#skF_1'),
inference(negUnitSimplification,[status(thm)],[c_598,c_1409]) ).
tff(c_1643,plain,
in('#skF_2',remove(2,'#skF_1')),
inference(superposition,[status(thm),theory(equality)],[c_1570,c_80]) ).
tff(c_1996,plain,
in('#skF_2',add(3,empty)),
inference(demodulation,[status(thm),theory(equality)],[c_1742,c_1643]) ).
tff(c_81,plain,
! [Z_6a: $int,X1_7: collection,X2_8a: $int] :
( in(Z_6a,X1_7)
| ~ in(Z_6a,add(X2_8a,X1_7))
| ( Z_6a = X2_8a ) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_2008,plain,
( in('#skF_2',empty)
| ( '#skF_2' = 3 ) ),
inference(resolution,[status(thm)],[c_1996,c_81]) ).
tff(c_2036,plain,
'#skF_2' = 3,
inference(negUnitSimplification,[status(thm)],[c_84,c_2008]) ).
tff(c_2052,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_558,c_2036]) ).
tff(c_2056,plain,
'#skF_2' = 2,
inference(splitRight,[status(thm)],[c_545]) ).
tff(c_48,plain,
$greater('#skF_2',3),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_59,plain,
$less(3,'#skF_2'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_48]) ).
tff(c_2108,plain,
$less(3,2),
inference(demodulation,[status(thm),theory(equality)],[c_2056,c_59]) ).
tff(c_2114,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_2108]) ).
tff(c_2118,plain,
'#skF_2' = 3,
inference(splitRight,[status(thm)],[c_546]) ).
tff(c_2141,plain,
$less(3,3),
inference(demodulation,[status(thm),theory(equality)],[c_2118,c_59]) ).
tff(c_2147,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_2141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT039_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/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.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 12:40:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 5.53/2.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.53/2.36
% 5.53/2.36 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.71/2.39
% 5.71/2.39 Inference rules
% 5.71/2.39 ----------------------
% 5.71/2.39 #Ref : 0
% 5.71/2.39 #Sup : 375
% 5.71/2.39 #Fact : 0
% 5.71/2.39 #Define : 4
% 5.71/2.39 #Split : 6
% 5.71/2.39 #Chain : 0
% 5.71/2.39 #Close : 0
% 5.71/2.39
% 5.71/2.39 Ordering : LPO
% 5.71/2.39
% 5.71/2.39 Simplification rules
% 5.71/2.39 ----------------------
% 5.71/2.39 #Subsume : 63
% 5.71/2.39 #Demod : 286
% 5.71/2.39 #Tautology : 213
% 5.71/2.39 #SimpNegUnit : 11
% 5.71/2.39 #BackRed : 29
% 5.71/2.39
% 5.71/2.39 #Partial instantiations: 0
% 5.71/2.39 #Strategies tried : 1
% 5.71/2.39
% 5.71/2.39 Timing (in seconds)
% 5.71/2.39 ----------------------
% 5.71/2.39 Preprocessing : 0.59
% 5.71/2.39 Parsing : 0.32
% 5.71/2.39 CNF conversion : 0.04
% 5.71/2.39 Main loop : 0.73
% 5.71/2.39 Inferencing : 0.22
% 5.71/2.39 Reduction : 0.20
% 5.71/2.39 Demodulation : 0.15
% 5.71/2.39 BG Simplification : 0.08
% 5.71/2.39 Subsumption : 0.14
% 5.71/2.39 Abstraction : 0.03
% 5.71/2.39 MUC search : 0.00
% 5.71/2.39 Cooper : 0.03
% 5.71/2.39 Total : 1.38
% 5.71/2.39 Index Insertion : 0.00
% 5.71/2.40 Index Deletion : 0.00
% 5.71/2.40 Index Matching : 0.00
% 5.71/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------